Dissecting AI

All papers

The Agentic Scientist: Orchestrating Coding Agents for Automated Scientific (Co-)Discovery

Robert Tjarko Lange, Luca Grillotti, Yutaro Yamada, Rujikorn Charakorn, David Ha

arXiv 2610.18933 88 pages Read the paper

The short version

The problem
Coding agents can write programs and run experiments, but that alone does not make research reliable. Researchers need ideas tested fairly, results checked against the methods, and claims tied to evidence before they can trust or communicate findings.
The idea
The paper builds a workflow that gives different agents distinct jobs: propose a testable idea, implement and check it, share useful findings with parallel workers, and later run comparisons and analyses on the strongest result. Each step is checked against explicit requirements, and the final paper is assembled from saved experimental evidence. For scientific diagrams, a companion tool first makes an editable diagram and only then uses image generation to polish it, checking the polished version against the original.
What it got
The system supported a human-supervised paper accepted for a conference and produced autonomous research results across several computing tasks. In one key transfer test, its learned optimizer matched or beat a standard optimizer on 5 of 7 previously unseen control tasks; its figure tool scored 37.5 versus 25.0 for the best comparison system.

Modules from this paper

Audited Editable Scientific Diagrams

Scientific figures can look polished while distorting a method; autoillustrate grounds panels in editable geometry, audits them, and treats image enhancement as a checked, reversible final step.

scientific-diagramsimage-generationverificationdraw.io

Evidence-Checked Orchestration for Computational Research

Computational research campaigns risk turning loosely coordinated experiments into unsupported claims; a staged, contract-driven agent workflow connects validated tasks, parallel investigation, retrospective evidence, and audited manuscript writing.

agentic-systemsscientific-workflowsevaluationresearch-orchestration

Exactly Subtractable Learned Evolution-Strategy Updates

Learned optimizers can inherit much of their apparent advantage from a strong classical core; zero-initialized bounded gates on separable CMA-ES make the learned contribution measurable against an exact identity-gate control.

evolution-strategiesCMA-ESlearned-optimizersmeta-learning

Query-Conditioned Adapter Composition for Long-Context Retrieval

When chunk adapters encode several facts, a query-blind merge can surface the wrong one; late-interaction scoring selects the relevant chunk’s adapter at composition time, while relevance-based placement and delimiter-aligned chunking address residual errors.

long-context retrievalLoRAadapter compositionquery routing