arXiv Machine Learning July 28, 2026 By Xuan Wu, Jinbiao Chen, Yang Li, Lijie Wen, Chunguo Wu, Yuanshu Li, Yubin Xiao, Chunyan Miao, You Zhou, Di Wang

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

Read the original on arXiv Machine Learning →

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.

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.

benchmarks

arXiv Machine Learning

Sep 1

One Adapter, Many Tasks: Task-Conditioned Feature Transformations for Continual Learning

arXiv:2608.31096v1 Announce Type: cross Abstract: Class-incremental learning (CIL) requires a model to incrementally learn tasks that contain new classes without accessing earlier training data while...

By Yunxiang Fu, Meng Lou, Yizhou Yu

fine-tuning

arXiv AI

Jun 2

Margin Adaptive DPO: Leveraging Reward Model for Granular Control in Preference Optimization

arXiv:2510. 05342v2 Announce Type: replace-cross Abstract: Direct Preference Optimization (DPO) has emerged as a simple and effective method for aligning large language models.

By Hyung Gyu Rho

llms nlp reinforcement-learning

arXiv Machine Learning

Aug 27

SHSP: Structure-Aware Hierarchical Solution Prediction for Mixed-Integer Linear Programming

The paper introduces SHSP, a Structure-Aware Hierarchical Solution Prediction framework for Mixed-Integer Linear Programming. SHSP replaces one-shot marginal decoding with a hierarchical conditional decoding that sequentially predicts variables based on a coupling graph derived from constraints, and includes a confidence-aware mask-and-repair step to correct errors. Experiments on four MILP benchmarks show SHSP reduces the solution gap by an average of 54% compared to existing one-shot methods.

By Zherong Zhang, Guanlin Li, Chengrui Gao, Haopu Shang, Ke Xue, Jixiang Lu, Weiyong Yang, Chao Qian

benchmarks

arXiv Machine Learning

Jul 28

A Multi-stage Constrained Optimization Framework for Data-driven Problems

arXiv:2607. 23480v1 Announce Type: new Abstract: Variational autoencoders (VAEs) transform high-dimensional, often noisy data into a compact latent representation, making downstream optimization more tractable.

By Ye Shi

diffusion safety

arXiv Machine Learning

Aug 26

Improving Cross-Problem Vehicle Routing with Locally Augmented Preferences and Representation Disentanglement

arXiv:2608.24859v1 Announce Type: new Abstract: Multi-task vehicle routing problem (VRP) solvers seek to handle multiple VRP variants within a single unified model, avoiding the need to train a separ...

By Arthur Corr\^ea, Paulo Nascimento, Samuel Moniz

reinforcement-learning benchmarks

arXiv Machine Learning

Jul 9

Efficient Long-Horizon Learning for Learned Optimization

arXiv:2607. 06772v1 Announce Type: new Abstract: Learned optimization aims to improve upon hand-designed optimizers (e.

By Xiaolong Huang, Benjamin Th\'erien, James Harrison, Eugene Belilovsky

llms computer-vision

One email a morning, machine-written

Related stories

One Adapter, Many Tasks: Task-Conditioned Feature Transformations for Continual Learning

Margin Adaptive DPO: Leveraging Reward Model for Granular Control in Preference Optimization

SHSP: Structure-Aware Hierarchical Solution Prediction for Mixed-Integer Linear Programming

A Multi-stage Constrained Optimization Framework for Data-driven Problems

Improving Cross-Problem Vehicle Routing with Locally Augmented Preferences and Representation Disentanglement

Efficient Long-Horizon Learning for Learned Optimization