Native Context Editing: A Grammar for LLM Context Edits
A new framework proposes that context editing is a native language ability and teaches LLM agents a grammar for it.
Preprints and papers, rewritten in plain English.
A new framework proposes that context editing is a native language ability and teaches LLM agents a grammar for it.
A new arXiv paper proposes HyperTaxa, a method that uses multiscale genome representations to improve microbial taxonomic inference when reference coverage is incomplete.
An open-source agentic framework aims to move model evaluation beyond identifying failures to diagnosing causes and verifying fixes.
A new arXiv paper argues that recovering from failures in long-horizon agents requires accounting for the persistent state that links a defect to its symptom.
A new paper formalizes how to certify Horn-rule conclusions when sources may fail in correlated ways.
EvoSkill v2 improves AI agents by automatically editing their task instructions, leaving the model and harness untouched.
A new framework asks whether reusable programs can chain local judgments into complex multistep reasoning.
A new dataset and interactive world models aim to move embodied AI beyond single-task, single-environment benchmarks.
A new arXiv study suggests that uncertainty estimates can help target expert review in automated diatom classification for freshwater biomonitoring.
A new arXiv preprint outlines a global probabilistic approach to forecasting fine particulate matter, a key air pollutant.
A new arXiv preprint applies an attention-based cross-talk architecture to compound fault diagnosis in motors, a key task for reliable condition monitoring in physical AI systems.
A new model applies System 1-style fast thinking to time series tasks, avoiding the token-heavy reasoning chains typical of LLMs.
A new arXiv paper argues that large language models fail at long-horizon tasks because they lack explicit, modifiable procedural memory.
A new study examines whether GEPA and SkillOpt gains replicate on locally served reasoning models.
A new generalized linear bandit algorithm provably achieves near-optimal regret with only one update per round, even when observation noise varies and rewards are adversarially corrupted.
A new paper shows that data thinning lets UCB-style Gaussian process bandits achieve near-optimal regret bounds, closing a gap long dominated by non-adaptive methods.
A new benchmark evaluates whether text-to-CAD systems can generate detailed industrial assemblies with functional parts and interfaces.
A new arXiv paper argues that single-outcome benchmark scores miss the variability of equivalent phrasings, proposing accessibility profiles to measure breadth and reliability.