AQuA: Recursively Self-Improving Quantitative Trading Research Agents

• URL: http://arxiv.org/abs/2608.12841v2
• Date: Mon, 17 Aug 2026 23:50:10 GMT
• Title: AQuA: Recursively Self-Improving Quantitative Trading Research Agents
• Abstract summary: We study whether an autonomous system can use evidence from earlier experiments to improve the hypotheses and candidates proposed in later iterations.<n>We present AQuA, which comprises two separate language-model-driven research systems.
• Score: 44.546401968461055
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study recursive self-improvement at the level of quantitative-investment research: whether an autonomous system can use evidence from earlier experiments to improve the hypotheses and candidates proposed in later iterations. We present AQuA, which comprises two separate language-model-driven research systems: one for symbolic factor discovery and one for trainable model development. The two systems do not share agents, memories, candidate spaces, or research state. Instead, each independently closes its own research loop by retaining validated evidence and using it to guide subsequent proposals. In this bounded sense, both systems implement recursive self-improvement at the level of the research process. Each system also uses its own sealed sandbox, which fixes the data splits, feature and label definitions, and evaluator while allowing the model to act only through constrained factor expressions or configuration diffs. The factor system, a manager-mediated multi-agent pipeline, discovers and combines factors into a signal that reaches a combined information coefficient of about $0.190$ on a crypto universe. The model system, a config-driven loop over a hybrid time-series architecture, reaches a per-stock information coefficient of $+0.0843$ on US equities and converts it into a threshold long/short strategy with a held-out Sharpe of up to $+2.50$ at a two-leg cost. The strategy is positive in every year from 2021 to 2025.

Related papers

• AutoScientist-Quant: Self-Evolving Coding Agents for Automatic Research in Quantitative Investment [28.36446889018906]
  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.
  arXiv  Detail & Related papers  (2026-08-05T23:34:46Z)
• Discovering Cooperative Pipelines: Autoresearch for Sequential Social Dilemmas [6.599344783327054]
  We study two-level autoresearch for cooperation: an outer-loop AI agent autonomously redesigns the inner-loop pipeline of a policy-synthesizer system.<n>A researcher agent reads the inner-loop source code, edits system prompts, feedback functions, helper libraries, and iteration logic, runs evaluations, and decides what to keep.
  arXiv  Detail & Related papers  (2026-05-28T14:33:10Z)
• 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)
• 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)
• $V_1$: Unifying Generation and Self-Verification for Parallel Reasoners [69.66089681814013]
  $V_$ is a framework that unifies generation and verification through efficient pairwise ranking.<n>$V_$-Infer improves Pass@1 by up to $10%$ over pointwise verification.<n>$V_$-PairRL achieves $7$--$9%$ test-time scaling gains over standard RL and pointwise joint training.
  arXiv  Detail & Related papers  (2026-03-04T17:22:16Z)
• Computational-Statistical Gaps in Gaussian Single-Index Models [77.1473134227844]
  Single-Index Models are high-dimensional regression problems with planted structure. We show that computationally efficient algorithms, both within the Statistical Query (SQ) and the Low-Degree Polynomial (LDP) framework, necessarily require $Omega(dkstar/2)$ samples.
  arXiv  Detail & Related papers  (2024-03-08T18:50:19Z)
• An Empirical Study of Multimodal Model Merging [148.48412442848795]
  Model merging is a technique that fuses multiple models trained on different tasks to generate a multi-task solution. We conduct our study for a novel goal where we can merge vision, language, and cross-modal transformers of a modality-specific architecture. We propose two metrics that assess the distance between weights to be merged and can serve as an indicator of the merging outcomes.
  arXiv  Detail & Related papers  (2023-04-28T15:43:21Z)
• FeDXL: Provable Federated Learning for Deep X-Risk Optimization [105.17383135458897]
  We tackle a novel federated learning (FL) problem for optimizing a family of X-risks, to which no existing algorithms are applicable. The challenges for designing an FL algorithm for X-risks lie in the non-decomability of the objective over multiple machines and the interdependency between different machines.
  arXiv  Detail & Related papers  (2022-10-26T00:23:36Z)
• Thompson sampling for linear quadratic mean-field teams [3.957353452014781]
  We consider optimal control of an unknown multi-agent linear quadratic (LQ) system where the dynamics and the cost are coupled across the agents. We propose a new Thompson sampling based learning algorithm which exploits the structure of the system model and show that the expected Bayesian regret of our proposed algorithm for a system with agents of different types at time horizon $T$ is $tildemathcalO big( |M|1.5 sqrtT big)$ irrespective of the total number of agents.
  arXiv  Detail & Related papers  (2020-11-09T19:07:32Z)

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.