Metraipolis › archive › dc_031fbfbf937a

Hard Instances on Demand — arXiv:2610.22637

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.22637
License (as archived)
CC0-1.0
Archived
2026-10-19T08:42:54.388Z
SHA-256 of the archived text
04ca986eaf8b48b139dbb070aab3f5d36367003fa2e5b9bf1db6df80d5556187
Stable URL of this page
https://metraipolis.com/documento/dc_031fbfbf937a

How to cite

Hard Instances on Demand — arXiv:2610.22637 — arXiv (en), https://arxiv.org/abs/2610.22637 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_031fbfbf937a (Metraipolis archive dc_031fbfbf937a, sha256 04ca986eaf8b48b139dbb070aab3f5d36367003fa2e5b9bf1db6df80d5556187)
BibTeX
@misc{dc031fbfbf937a,
  title = {Hard Instances on Demand — arXiv:2610.22637},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.22637},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_031fbfbf937a; sha256 04ca986eaf8b48b139dbb070aab3f5d36367003fa2e5b9bf1db6df80d5556187},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.22637. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The conclusions of an experimental study of algorithms are only as good as the instances they are run on. Benchmark libraries for well-studied problems took decades to curate, while evaluations of new problems often fall back on random instances, which are known to be misleading: they may say more about the random generator than about the algorithmic question at hand. We treat instance generation as an optimization problem: parameterize the instance space, take the solver's running time as the objective, and let a black-box optimizer search for hard instances. We develop a widely applicable workflow built on the Nevergrad optimization platform and demonstrate it on four NP-hard problems: satisfiability, traveling salesperson, Hamiltonian cycle, and non-permutation flow-shop scheduling. The search needs only the solver, an instance encoder, and a compute budget. Our evolved instances beat the hardest instance of a budget-matched random draw in all four case studies, by an order of magnitude or more in three. They are often competitive with long-curated benchmark sets: our SAT champion is harder (for a three-solver portfolio) than 78% of the 498 SAT Competition formulas in its size class; our 20-city TSP champions take several times longer than the hardest measured classical TSPLIB instance (229 cities); and our flow-shop champion takes 238.6 seconds of CP Optimizer time to solve to proven optimality (versus 4.5 seconds for the hardest of 100,000 random draws) while denying CP-SAT an optimality proof. The optimizer even recovers known structure from running time alone: it locates a SAT clause/variable ratio near the phase transition and finds structurally different champions for the two scheduling engines.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Artificial Intelligence (cs.AI); Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.22637 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T08:39:10.118Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).