AutoScientist-Quant: Self-Evolving Coding Agents for Automatic Research in Quantitative Investment

• URL: http://arxiv.org/abs/2608.28632v2
• Date: Tue, 01 Sep 2026 10:45:43 GMT
• Title: AutoScientist-Quant: Self-Evolving Coding Agents for Automatic Research in Quantitative Investment
• Abstract summary: We present AutoScientist-Quant, a self evolving search process that regards quantitative research as one budgeted search problem.<n>A single controller conditions every decision on the remaining budget, choosing at each round whether to improve, combine, pivot, or stop, which node to expand, how many alphas to generate, and how to retrieve past trajectories from the shared memory.<n>The framework attains the best value of nearly every metric in every setting, and these conclusions hold across several backbones and markets.
• Score: 28.36446889018906
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Large language model agents can discover alphas, yet current methods have three weaknesses. The search cannot adapt during the run, automation usually ends at alpha generation while library selection and model choice stay manual, and alpha discovery can read the test window through loop feedback or code problems. We present AutoScientist-Quant, a self evolving search process that regards quantitative research as one budgeted search problem. A single controller conditions every decision on the remaining budget, choosing at each round whether to improve, combine, pivot, or stop, which node to expand, how many alphas to generate, and how to retrieve past trajectories from the shared memory. The same core then selects from the library and tunes the model, closing the loop from hypothesis to deployable strategy. We also review the evaluation pipeline reused from prior work, fix two lookahead problems, and keep the feedback window disjoint from the held out test window, so every comparison tests true generalization. On CSI universes, the framework attains the best value of nearly every metric in every setting, and these conclusions hold across several backbones and markets.

Related papers

• AgentFold: Closed-Loop Agentic Search for Protein Folding Model Design [27.154390712714264]
  We present AgentFold, a framework that formulates folding-model development as a closed-loop search over executable code variants.<n>Under a matched computational budget, AgentFold improves the best lDDT by 7.5% over independent Codex proposals.<n>The resulting intervention traces reveal recurring empirical design patterns.
  arXiv  Detail & Related papers  (2026-08-27T07:38:16Z)
• Recovering Wasted Compute in Autoresearch Agents [35.718169903054736]
  We study the modeling pipeline at the core of autoresearch systems and identify common failure modes.<n>We find that large gains in autoresearch agent performance are achievable through agentic design alone.
  arXiv  Detail & Related papers  (2026-08-11T03:15:08Z)
• The Optimizer Is the Agent: Reasoning-Driven Search across Prompts, Programs, and ML Workflows [72.9051182568928]
  We present ReASearch, a unified framework for reasoning-driven optimization.<n>With a shared agent loop and domain-specific tools, ReASearch instantiates the exact same scaffold to optimize prompts, programs, and ML.<n>We observe that complex search behaviors emerge naturally from the agent's reasoning process.
  arXiv  Detail & Related papers  (2026-08-07T02:15:39Z)
• SearchOS-V1: Towards Robust Open-Domain Information-Seeking Agent Collaboration [77.28003194268977]
  SearchOS is a system-level multi-agent framework that turns fragile, implicit search progress into explicit, persistent, and shared state.<n>Built on SOCM, SearchOS applies a pipeline-parallel scheduling mechanism that overlaps the execution of sub-agents.<n>SearchOS leads all metrics among the evaluated single- and multi-agent baselines.
  arXiv  Detail & Related papers  (2026-07-16T17:51:23Z)
• AlphaMemo: Structured Search-Process Memory for Self-Evolving Alpha Mining Agents [87.95001910627825]
  AlphaMemo is a self-evolving alpha mining agent with Structured Search-Process Memory.<n>It records reusable evidence about which edit motifs work or fail under specific parent-factor contexts.<n>Experiments on CSI 500 and S&P 500 show improved out-of-sample performance and fixed-budget discovery efficiency.
  arXiv  Detail & Related papers  (2026-05-26T15:48:09Z)
• NanoResearch: Co-Evolving Skills, Memory, and Policy for Personalized Research Automation [59.19858972597063]
  LLM-powered multi-agent systems can now automate the full research pipeline from ideation to paper writing, but a fundamental question remains: automation for whom?<n>We propose NanoResearch, a multi-agent framework that addresses these gaps through tri-level co-evolution.<n>A skill bank distills recurring operations into compact procedural rules reusable across projects.<n>A memory module maintains user- and project-specific experience that grounds planning decisions in each user's research history.<n>A label-free policy learning converts free-form feedback into persistent parameter updates of the planner, reshaping subsequent coordination.
  arXiv  Detail & Related papers  (2026-05-11T16:33:47Z)
• AlphaLab: Autonomous Multi-Agent Research Across Optimization Domains with Frontier LLMs [14.167136550376497]
  We present AlphaLab, an autonomous research harness that automates the full experimental cycle in computation-intensive domains.<n>It adapts to the domain and explores the data, writing analysis code and producing a research report.<n>It runs large-scale experiments via a Strategist/Worker loop, accumulating domain knowledge in a persistent playbook.
  arXiv  Detail & Related papers  (2026-03-31T21:16:20Z)
• AI-Supervisor: Autonomous AI Research Supervision via a Persistent Research World Model [1.14219428942199]
  Existing automated research systems operate as stateless, linear pipelines.<n>We present textbfAI-Supervisor, a multi-agent orchestration framework.<n>Agents provide end-to-end AI research supervision driven by human interests.
  arXiv  Detail & Related papers  (2026-03-25T15:16:51Z)
• Improving Coherence and Persistence in Agentic AI for System Optimization [9.443037059325086]
  Engram organizes exploration into a sequence of agents that iteratively design, test, and analyze mechanisms.<n>We find that Engram exhibits superior performance across diverse domains including multi-cloud multicast inference, LLM request routing, and optimizing KV cache reuse in databases with natural language queries.
  arXiv  Detail & Related papers  (2026-03-22T17:04:50Z)
• CompassVerifier: A Unified and Robust Verifier for LLMs Evaluation and Outcome Reward [50.97588334916863]
  We develop CompassVerifier, an accurate and robust lightweight verifier model for evaluation and outcome reward.<n>It demonstrates multi-domain competency spanning math, knowledge, and diverse reasoning tasks, with the capability to process various answer types.<n>We introduce VerifierBench benchmark comprising model outputs collected from multiple data sources, augmented through manual analysis of metaerror patterns to enhance CompassVerifier.
  arXiv  Detail & Related papers  (2025-08-05T17:55:24Z)
• RAVine: Reality-Aligned Evaluation for Agentic Search [7.4420114967110385]
  RAVine is a Reality-Aligned eValuation framework for agentic LLMs with search.<n> RAVine targets multi-point queries and long-form answers that better reflect user intents.<n>We benchmark a series of models using RAVine and derive several insights.
  arXiv  Detail & Related papers  (2025-07-22T16:08:12Z)
• Long-Span Question-Answering: Automatic Question Generation and QA-System Ranking via Side-by-Side Evaluation [65.16137964758612]
  We explore the use of long-context capabilities in large language models to create synthetic reading comprehension data from entire books. Our objective is to test the capabilities of LLMs to analyze, understand, and reason over problems that require a detailed comprehension of long spans of text.
  arXiv  Detail & Related papers  (2024-05-31T20:15:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.