Metraipolis › archive › dc_c352cf54f66e
Recasting the Destroy Step of Large Neighborhood Search as Dense Segmentation — arXiv:2609.22350
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.22350
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T01:01:03.022Z
- SHA-256 of the archived text
16a9ac9c8979f00c64ac752f4ec0189edb75f949a32c91425f41b8774a97c82c- Stable URL of this page
https://metraipolis.com/documento/dc_c352cf54f66e
How to cite
Recasting the Destroy Step of Large Neighborhood Search as Dense Segmentation — arXiv:2609.22350 — arXiv (en), https://arxiv.org/abs/2609.22350 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c352cf54f66e (Metraipolis archive dc_c352cf54f66e, sha256 16a9ac9c8979f00c64ac752f4ec0189edb75f949a32c91425f41b8774a97c82c)
BibTeX
@misc{dcc352cf54f66e,
title = {Recasting the Destroy Step of Large Neighborhood Search as Dense Segmentation — arXiv:2609.22350},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.22350},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c352cf54f66e; sha256 16a9ac9c8979f00c64ac752f4ec0189edb75f949a32c91425f41b8774a97c82c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.22350. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Large neighborhood search improves an incumbent by releasing selected variables and repairing the resulting subproblem under a time limit. FOVEA casts variable selection as dense semantic segmentation on a fixed $128\times128$ canvas. A small U-Net reads twelve semantic channels and predicts cell scores, which are decoded into a variable set subject to a fixed variable budget. Family-specific layouts connect the search state to the canvas, while one set of network weights serves four problem families. The FP32 network input occupies $786$\,kB across instance sizes. Our analysis bounds constraint coupling for spatially coherent regions, gives a rank certificate for rounds with zero possible improvement, and bounds the coupling advantage attainable on an expander family. On the tested families and hardware, FOVEA trails the strongest graph encoder at $10^{4}$ variables and overtakes it near $1.5\times10^{4}$; the cost model provides an approximate crossover estimate. At larger sizes, where the graph-encoder baselines exceed device memory, FOVEA reduces the primal integral by $12$ to $16\%$ relative to the best runnable baselines. On the expander family, FOVEA performs comparably to random selection, with a coupling advantage close to one.
Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-22 in eess.IV).
Categorie arXiv: Image and Video Processing (eess.IV).
Pagina del lavoro: https://arxiv.org/abs/2609.22350 — 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-10T00:12:50.777Z dalla pagina https://arxiv.org/catchup/eess.IV/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).