arXiv AI By Wenjie Qiu, Hepei Li, Jianfeng Wang, Jun Zhang, Yue-Jiao Gong

WCC: A Learning-Based Framework for Deciding When to Apply Cooperative Coevolution in Large-Scale Optimization

Read the original on arXiv AI →

WCC is a learning‑based framework that decides dynamically when to apply Cooperative Coevolution (CC) versus Non‑Decomposition Algorithms (NDAs) in large‑scale global optimization. It models this decision as a Markov decision process, using a tailored feature set, reward scheme, and network architecture to enable fine‑grained, adaptive switching and conditional budget allocation without expert input. Experiments show WCC competes strongly and generalizes across problems, horizons, and baseline optimizers, supporting a low‑budget "train‑once and reuse" approach while providing new practical insights into CC deployment.

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 AI.

arXiv AI
Sep 21

Collab-Solver: Collaborative Solving Policy Learning for Mixed-Integer Linear Programming

Collab‑Solver introduces a multi‑agent policy learning framework for mixed‑integer linear programming (MILP) that enables collaborative optimization of multiple solver modules. By modeling the interaction between cut selection and branching as a Stackelberg game, the approach employs a two‑phase learning paradigm—data‑communicated policy pretraining followed by coordinated policy refinement. Experiments on synthetic and large‑scale real‑world MILP datasets show that the jointly learned policies markedly improve solving performance and generalize well across diverse instance sets.

By Siyuan Li, Yifan Yu, Zhihao Zhang, Mengjing Chen, Fangzhou Zhu, Tao Zhong, Peng Liu, Jianye Hao
arXiv Machine Learning
Oct 28

Preference-Guided Cooperation in Multi-Objective Multi-Agent Reinforcement Learning

The paper introduces Meta-Gradient Informed Multi-Objective Multi-Agent Reinforcement Learning (MIRL), a framework that leverages the structure of multiple objectives to enhance cooperation among agents. By formulating MOMARL at both team and individual levels and using objective-wise counterfactual credit assignment, MIRL allows agents to learn how to prioritize objectives individually while jointly optimizing a system-level objective. Experiments on a multi-objective particle environment demonstrate that MIRL, especially its dynamic variant, improves Pareto-front quality compared to baseline methods.

By Qiyue Xia, J. Michael Herrmann
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