




















Abstract:We study efficiency as a first-class objective in Neural Combinatorial Optimization (NCO) and present ECO, an efficient learning framework that combines batched preference optimization with a Mamba backbone. Instead of tightly interleaving every policy update with on-policy rollouts, ECO decouples trajectory generation from gradient updates through two stages: supervised warm-up on pre-computed solutions and iterative Direct Preference Optimization (DPO) on batched candidate sets generated by the current policy. We pair this learning pipeline with a mixed Mamba encoder-decoder that reduces memory growth on long sequences and improves hardware utilization. A local-search-guided bootstrapping strategy is further used during training to widen preference margins and stabilize iterative improvement. Importantly, local search is only used to construct stronger preference pairs during training and is never invoked at inference time. On TSP and CVRP, ECO achieves the strongest overall performance among the compared neural baselines while also delivering clear advantages in memory usage and throughput. We provide additional analysis on memory scaling, throughput, and the contribution of each design component.
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2602.20730 [cs.LG] |
| (or arXiv:2602.20730v2 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2602.20730 arXiv-issued DOI via DataCite |
From: Zhenxing Xu [view email]
[v1]
Tue, 24 Feb 2026 09:53:24 UTC (1,379 KB)
[v2]
Tue, 28 Apr 2026 02:42:22 UTC (383 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。