{"slug": "hard-to-fool-a-bounded-llm-research-loop-for-quantitative-finance", "title": "Hard to Fool: A bounded LLM research loop for quantitative finance", "summary": "A November 4, 2026 arXiv paper (q-fin.CP, 2611.06607) describes Autonomous Quant Researcher, an open-source LLM research loop for quantitative finance in which the model proposes strict declarative JSON changes and only trusted code decides acceptance. Across campaigns spanning 0DTE options, overnight SPX verticals, daily ETF rules, Kalshi crypto binaries, earnings options and a pre-registered alternative-data campaign, most hypotheses failed; the paper's clearest demonstration was a language-model survivor that reached Sharpe ratios near 3 in discovery and validation but fell to 0.26 on its single holdout use. The authors argue the loop's value lies in how hard it is to make it report a result that is not there.", "body_md": "# Quantitative Finance > Computational Finance\n\n  [Submitted on 4 Nov 2026]\n\n# Title:Hard to Fool: A Bounded LLM Research Loop for Quantitative Finance, and What Two Dozen Campaigns Found\n\n[View PDF](https://arxiv.org/pdf/2611.06607)\n\n[HTML (experimental)](https://arxiv.org/html/2611.06607v1)\n\nAbstract:Agentic research loops that let a language model propose a change, run a fixed experiment and keep whatever improves the metric work well in machine learning. In trading research the same loop is a machine for producing false discoveries: a backtest that \"improves the metric\" is, by default, overfit, look-ahead, a multiple-comparisons artifact, cost-free, or market drift wearing a strategy. We describe Autonomous Quant Researcher, an open-source loop built on the opposite premise: the model proposes, and only trusted code decides. Proposals are strict declarative JSON over a fixed vocabulary, so there is no model-written code to sandbox. Evaluation runs on immutable chronological stores split into discovery, validation and a final holdout that can be opened exactly once, after a durable receipt is written. Acceptance is a conjunction of absolute gates (positive edge and net P&L after costs, a positive weekly-cluster bootstrap lower bound, survival at elevated costs, per-year stability and sample floors), never a single score. Duplicates are refused before they spend a trial, and every formulation, refusal, crash and result is kept in a hash-chained, append-only ledger. We report every campaign run to date, across 0DTE options priced from traded option bars, overnight SPX verticals, daily ETF rules, technical-analysis premises, Kalshi crypto binaries, earnings options, off-exchange volume and a pre-registered alternative-data campaign. Most hypotheses fail, and we report them. Two results survive their pre-registered bars. The clearest example of the loop working is a failure: a language-model survivor that passed discovery and validation with Sharpe ratios near 3 and fell to 0.26 on its single holdout use. The value of such a loop lies less in what it finds than in how hard it is to make it report something that is not there.\n    \n\n### Current browse context:\n\nq-fin.CP\n\n### References & Citations\n\nLoading...\n\n# Bibliographic and Citation Tools\n\nBibliographic Explorer \n\n*(*[What is the Explorer?](https://info.arxiv.org/labs/showcase.html#arxiv-bibliographic-explorer))\nConnected Papers \n\n*(*[What is Connected Papers?](https://www.connectedpapers.com/about))\nLitmaps \n\n*(*[What is Litmaps?](https://www.litmaps.co/))\nscite Smart Citations \n\n*(*[What are Smart Citations?](https://www.scite.ai/))\n# Code, Data and Media Associated with this Article\n\nalphaXiv \n\n*(*[What is alphaXiv?](https://alphaxiv.org/))\nCatalyzeX Code Finder for Papers \n\n*(*[What is CatalyzeX?](https://www.catalyzex.com))\nDagsHub \n\n*(*[What is DagsHub?](https://dagshub.com/))\nGotit.pub \n\n*(*[What is GotitPub?](http://gotit.pub/faq))\nHugging Face \n\n*(*[What is Huggingface?](https://huggingface.co/huggingface))\nScienceCast \n\n*(*[What is ScienceCast?](https://sciencecast.org/welcome))\n# Demos\n\n# Recommenders and Search Tools\n\nInfluence Flower \n\n*(*[What are Influence Flowers?](https://influencemap.cmlab.dev/))\nCORE Recommender \n\n*(*[What is CORE?](https://core.ac.uk/services/recommender))\n# arXivLabs: experimental projects with community collaborators\n\narXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.\n\nBoth individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.\n\nHave an idea for a project that will add value for arXiv's community? [**Learn more about arXivLabs**](https://info.arxiv.org/labs/index.html).", "url": "https://wpnews.pro/news/hard-to-fool-a-bounded-llm-research-loop-for-quantitative-finance", "canonical_source": "https://arxiv.org/abs/2611.06607", "published_at": "2026-11-05 15:10:41+00:00", "updated_at": "2026-11-05 15:25:42.862310+00:00", "lang": "en", "topics": ["artificial-intelligence", "large-language-models", "ai-agents", "ai-research"], "entities": ["Autonomous Quant Researcher", "arXiv", "SPX", "Kalshi"], "also_reported_by": [], "alternates": {"html": "https://wpnews.pro/news/hard-to-fool-a-bounded-llm-research-loop-for-quantitative-finance", "markdown": "https://wpnews.pro/news/hard-to-fool-a-bounded-llm-research-loop-for-quantitative-finance.md", "text": "https://wpnews.pro/news/hard-to-fool-a-bounded-llm-research-loop-for-quantitative-finance.txt", "jsonld": "https://wpnews.pro/news/hard-to-fool-a-bounded-llm-research-loop-for-quantitative-finance.jsonld"}}