arXiv (All)
open access
Spread and Scale: What Determines Whether Test-Time Budget Allocation Pays
Neural combinatorial optimization solvers generate many candidate solutions per instance and report the best one found, using the same sample budget for every instance regardless of difficulty. A companion study showed that reallocating a fixed budget toward harder instances can improve solution qua
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Intelligent budget planner#1024826
- Generative Profiling for Soft Real-Time Systems and its Applications to Resource Allocation#2711
- CompMat-Bench: Benchmarking AI Agents for Computational Materials Science#1155571
- Ising-based Test Optimization and Benchmarking#10443
- WhatWorkedBench: Benchmarking Experimental Understanding in AI Agents#1064034
Record · ID 1064461
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive