arXiv AI
Aug 6
Improving Auto-Design of Neural PDE Solvers with a Domain-Specific Language
arXiv:2608. 04384v1 Announce Type: new Abstract: Neural PDE solver auto-design is fundamentally a search-space representation problem.
AutoPDE: Reliable Agentic PDE Solving via Explicitly Represented Solver Strategies
arXiv:2606. 10752v1 Announce Type: new Abstract: Numerical solvers for partial differential equations (PDEs) are core computational tools in science and engineering.
Related stories
arXiv AI
Aug 5
Large language models for partial differential equation workflows
arXiv:2608. 03600v1 Announce Type: new Abstract: Partial differential equations (PDEs) become actionable in science and engineering not as isolated formulae, but as executable workflows that connect modelling assumptions, governing equations, numerical solvers, diagnostics, and decisions.
arXiv AI
Jul 14
Reinforcement Learning with Verifiable Physics: Post-training LLMs with Continuous Rewards
arXiv:2607. 10474v1 Announce Type: cross Abstract: Partial differential equations (PDEs) are foundational to modeling in science and engineering, but constructing reliable numerical solvers remains labor-intensive, demanding expert knowledge of discretization schemes, stability conditions, and boundary treatments.
arXiv AI
Jun 29
Auto-Configuring Scientific Simulators with Lightweight Coding-Agent Adapters
arXiv:2606. 09774v2 Announce Type: replace Abstract: Configuring an advanced scientific simulator, translating a modeling goal into a valid, runnable input deck, is a persistent bottleneck that costs domain scientists hours to days.
arXiv Machine Learning
Jun 10
Compile Once, Differentiate Everywhere: A Differentiable Meta-Circular Interpreter
arXiv:2606. 09930v1 Announce Type: cross Abstract: The boundary between program execution and gradient-based optimization has long limited the use of code itself as a learnable scientific model.
arXiv AI
Jul 7
SkillOpt-Lite: Better and Faster Agent Self-evolution via One Line of Vibe
arXiv:2607. 03451v1 Announce Type: cross Abstract: While skill optimization for autonomous agents has gained traction, existing methods rely on complex pipelines.
arXiv AI
Jun 6
AutoDFT: A Closed-Loop Multi-Agent Framework for Autonomous DFT Calculations
arXiv:2605. 26179v2 Announce Type: replace-cross Abstract: Density functional theory (DFT) serves as the basis for computational discovery in materials science and chemistry, yet each calculation demands extensive human effort: adjusting algorithms when convergence stalls, revising plans when unexpected physics emerges, and inserting steps as intermediate results reshape the problem.
arXiv AI
Jul 21
TRIM: Reducing AI-Generated CodeSlop via Agent Trajectory Minimization
arXiv:2607. 18161v1 Announce Type: cross Abstract: Coding agents are increasingly used to accelerate code generation in many downstream tasks, such as fixing bugs, building applications, and prototyping.
arXiv Machine Learning
4d ago
HeurEvo: Agentic Evolution of Hybrid Solver-Augmented Heuristics for Time-Critical Mathematical Optimization
arXiv:2609.36303v1 Announce Type: cross Abstract: Recent advances in agentic heuristic design use AI agents and execution feedback to automate algorithm discovery for challenging optimization problem...
arXiv AI
3d ago
RankEvolve: A Reliable Multi-Agent Auto-Research Harness for Evolving Ranking Models
RankEvolve is an auto‑research framework that evolves generative ranking models by orchestrating multiple large‑language‑model coding agents through an Executable Operating Protocol (EOP). The system compiles a state machine that enforces phases, gates, branches, and loops, while a meta‑meta‑harness lets agents review and repair each other’s code. In budget‑matched experiments, heterogeneous composition of agents raised execution accuracy from 45.8 % to 62.5 % and reduced silent critical‑defect rates, achieving notable gains on the HSTU recommender and other benchmarks.
arXiv AI
Sep 25
Coding Agents for Generalized Task and Motion Planning Problems
The paper investigates whether large language model–based coding agents can automatically synthesize programs that solve generalized task and motion planning (TAMP) problems across diverse instances. Using Claude Code and Codex, the authors evaluate 980 generated programs on 100 held‑out environments from KinDER and PDDLStream, achieving mean success rates between 56 % and 95 %—higher than hand‑engineered planners and other baselines—while requiring an order of magnitude less computation per instance. The study demonstrates that coding agents can calibrate physical models, test edge cases, and refine strategies, suggesting they are a strong baseline for generalized TAMP.
arXiv AI
Aug 26
Beyond Executable Models: The Pufibara Agent Harness and the Modelica Agent Workflow Benchmark for Physical System Modeling
The paper introduces Pufibara, an agent harness designed to maintain engineering state and evidence across revisions in Modelica-based physical system modeling. It also presents a 232-task Modelica Agent Workflow Benchmark covering model repair, generation, and tuning, evaluated by an external benchmark-owned evaluator. Experiments show Pufibara outperforms Claude Code in task success and resource efficiency across two LLM backends.