← Back to all news
arXiv Machine Learning By Zhenxing Xu, Zeyuan Ma, Weidong Bao, Yan Zheng, Chongshuang Hu, Ji Wang, Zhiguang Cao

Rethinking Efficiency in Neural Combinatorial Optimization: Batched Preference Optimization with Mamba

Read the original on arXiv Machine Learning →

arXiv:2602. 20730v3 Announce Type: replace 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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
Jul 28

WeCon: An Efficient Weight-Conditioned Neural Solver for Multi-Objective Combinatorial Optimization Problems

arXiv:2605. 22876v2 Announce Type: replace Abstract: Existing neural solvers for Multi-Objective Combinatorial Optimization Problems (MOCOPs) commonly adopt decomposition-based strategies that scalarize a MOCOP into multiple subproblems associated with distinct weight vectors.

By Xuan Wu, Jinbiao Chen, Yang Li, Lijie Wen, Chunguo Wu, Yuanshu Li, Yubin Xiao, Chunyan Miao, You Zhou, Di Wang
benchmarks
More like this →
arXiv Computation and Language
Sep 3

GroupDPO: Memory-Efficient Group-Wise Direct Preference Optimization

GroupDPO introduces a memory‑efficient approach to group‑wise direct preference optimization for aligning large language models. By using first‑order linearization with per‑response coefficients, the method decouples samples during backpropagation, dramatically reducing peak memory usage and enabling scalable training with larger groups. Experiments in both offline and online settings show that leveraging multiple responses consistently outperforms single‑pair training, and adding a negative log‑likelihood term on positive responses is essential for performance gains and training stability.

By Jixuan Leng, Si Si, Hsiang-Fu Yu, Vinod Raman, Inderjit S. Dhillon
llms
More like this →
arXiv Machine Learning
1d ago

MiLoop: Selective Memory Propagation for Neural Combinatorial Optimization

MiLoop is a reinforcement‑learning‑based constructive framework for neural combinatorial optimization that propagates selective memory across rollout steps. By fusing current embeddings with historical memory before attention layers and applying adaptive gated updates afterward, it enables a shallow policy to learn dynamic embeddings without external solution labels or search‑space pruning. Experiments on four combinatorial optimization problems show MiLoop consistently generates high‑quality solutions for instances ranging from 100 to 10 million nodes, demonstrating strong generalization.

By Changliang Zhou, Yuanyao Chen, Rongsheng Chen, Zhiyun Lin, Zhenkun Wang
ragreinforcement-learningefficiency
More like this →