Graph Crimes of the Temporal Kind: How LoReTTA Quietly Breaks Time
LoReTTA shows that temporal graph models can be weakened by subtle, resource-light poisoning of interaction history, not only by noisy brute-force attack.
LoReTTA shows that temporal graph models can be weakened by subtle, resource-light poisoning of interaction history, not only by noisy brute-force attack.
A mechanism-first look at how pretrained language models can be surgically converted into depth-recurrent reasoners—and why the gains are useful, conditional, and not remotely free.
A comparison-led reading of why VLM robot planners need feedback, memory, and carefully tuned replanning rather than blind faith in more model calls.
A mechanism-first reading of how VISA uses LLM orchestration, memory, and specialised agents to make voice-controlled surgical data interfaces more reliable.
SpatialThinker shows that better reward design, not just more data or depth sensors, can make multimodal models reason more reliably about 3D space.
A practical reading of new learning-theory results showing why noisy data may still permit generation, but can quietly destroy broad coverage.
PhysWorld shows how generated task videos become useful for robots only after geometry, physics, and residual learning do the unfashionable work.
A mechanism-first look at why DiagramIR’s structured back-translation pipeline makes AI-generated math diagrams easier to verify, cheaper to govern, and harder to excuse.
A close reading of an AI data-visualization platform paper shows where automated analytics can compress workflow, and where the evidence still stops short of replacing analysts.
A mechanism-first analysis of how multi-agent Text-to-Cypher systems turn graph querying from brittle prompting into executable, database-grounded retrieval.