CADAQUES: A Cost-Aware Dual Architecture for Query-Efficient Autonomous Discovery

2026-07-17Software Engineering

Software Engineering
AI summary

The authors developed CADAQUES, a Python framework designed for autonomous discovery systems that treats cost as a key factor when deciding what questions to ask next. Unlike typical frameworks that ignore the cost of queries and decision-making, CADAQUES tracks these costs in multiple ways, like time, money, and computing resources. They demonstrated their approach by finding the critical temperature in a physics model, showing that using cheap, low-quality queries first and then refining results with more expensive, accurate queries works better than just high-quality queries. Their system also efficiently records and compares predicted and actual costs for each step. The framework is open source and available under an MIT license.

autonomous discovery systemsnumerical optimizationquery costtwo-dimensional Ising modelcritical temperaturelow-fidelity querieshigh-fidelity queriesresource meteringopen-source frameworkPython
Authors
Jorge Bravo-Abad
Abstract
Autonomous discovery systems couple a resource that answers queries (a simulator, instrument, or analytic model) to an algorithm that selects what to query next. Most software frameworks for this loop inherit the control structure of numerical optimization: campaigns run for a fixed number of iterations, query costs are absent from the programming interface, and decision-making is treated as free. In practice, queries may differ in cost by orders of magnitude, and planners built on large language models or expensive surrogates consume resources of their own. Here we present CADAQUES, an open-source Python framework built on one architectural principle: cost is a first-class primitive of the discovery loop. CADAQUES separates the loop into two structural protocols, an Oracle that answers queries and a Driver that proposes them, and charges both evaluations and decisions against a common vector-valued budget spanning wall time, CPU hours, monetary cost, and language model tokens. An append-only ledger records, for each transaction, the cost declared before execution and the cost settled afterwards, making their discrepancy an observable property of the campaign. We evaluate the architecture by locating the critical temperature of the two-dimensional Ising model from noisy finite-size estimates against the exact thermodynamic-limit reference. In this noisy setting, strategies that concentrate around the best observed result can be misled by noise-induced peaks, whereas a schedule that explores with cheap low-fidelity queries and refines with higher-fidelity ones yields lower and less variable errors than high fidelity throughout, at the studied budget scale. Metering adds tens of microseconds per iteration, three orders of magnitude below the cheapest oracle query. The framework is MIT-licensed and archived at Zenodo (doi:10.5281/zenodo.21293589).