Metraipolis › archive › dc_2187fd9ea0e7
Optimization for One, Feasibility for Most: Decoupling Optimization from Feasibility in Chance-Constrained Programs — arXiv:2610.19027
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.19027
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T14:23:12.469Z
- SHA-256 of the archived text
42a8b32daa7c1688a9a955c89844fc49eb96cb563b15fb5b28fcb8064383d616- Stable URL of this page
https://metraipolis.com/documento/dc_2187fd9ea0e7
How to cite
Optimization for One, Feasibility for Most: Decoupling Optimization from Feasibility in Chance-Constrained Programs — arXiv:2610.19027 — arXiv (en), https://arxiv.org/abs/2610.19027 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2187fd9ea0e7 (Metraipolis archive dc_2187fd9ea0e7, sha256 42a8b32daa7c1688a9a955c89844fc49eb96cb563b15fb5b28fcb8064383d616)
BibTeX
@misc{dc2187fd9ea0e7,
title = {Optimization for One, Feasibility for Most: Decoupling Optimization from Feasibility in Chance-Constrained Programs — arXiv:2610.19027},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.19027},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2187fd9ea0e7; sha256 42a8b32daa7c1688a9a955c89844fc49eb96cb563b15fb5b28fcb8064383d616},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.19027. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Chance-constrained stochastic programs (CCSPs) require solutions that satisfy uncertain constraints with high probability. Standard approaches either embed scenarios directly into optimization by considering sample average approximation (SAA)-based reformulations, growing prohibitively expensive and often failing to find feasible solutions; or employ conservative reformulations that guarantee feasibility but sacrifice objective quality by design. We propose ACCESS (Adaptive Chance-Constrained Exploration via Structured Sampling), a structured sampling framework that decouples optimization from feasibility evaluation. First, high-quality candidate solutions are generated by solving many inexpensive single-scenario subproblems, avoiding sampling directly in the constrained high-dimensional solution space. Second, feasibility is assessed separately via large-scale batched simulation over a massive number of scenarios, which is naturally amenable to GPU parallelism. That reduces the search from a high-dimensional solution space to a two-dimensional parameter space controlling conservatism and scenario diversity; while concentrating on candidates near the feasibility boundary, where high-quality feasible solutions lie. We also introduce a variant, ACCESS($\delta$), which provides certified feasibility guarantees with probability $1-\delta$. Experiments across three benchmark classes and five scenario distributions show that ACCESS matches or exceeds the best objective found by any method in nearly every setting, while ACCESS($\delta$) is empirically feasible on every instance. The conservative reformulations remain several percent worse in objective, and SAA is frequently infeasible while taking an order of magnitude longer on the harder benchmarks. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Optimization and Control (math.OC) ; Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2610.19027 — 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-15T13:53:35.820Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).