📝 Selected Publications


ICML 2026
m2genco

(CCF-A) Problem Distributions as Tasks: Repurposing Meta Learning for Generative Combinatorial Optimization towards Multi-task Pretrain and Adaptation [PDF][Code github-stars]

Wenzheng Pan, Jiale Ma, Nuoyan Chen, Yang Li, Junchi Yan

We introduce M²GenCO, a meta-generative framework that treats problem distributions as tasks to enable efficient multi-task pretraining, few-shot adaptation, and robust generalization across graph-based combinatorial optimization problems.

ICML 2026
ml4lp

(CCF-A) Design Linear Constrained Neural Layers with Implicit Convex Optimization [PDF]

Junchi Yan, Jiaxi Liu, Liangliang Shi, Fangyuan Zhou, Wenzhen Pan, Zhongteng Gui, Yihui Tu

We propose LinConLayer, a plug-in differentiable neural layer that enforces general linear constraints via implicit convex optimization, yielding efficient BLCLayer and GLCLayer variants for constrained prediction in tasks such as graph matching, portfolio allocation, and linear programming.

NeurIPS 2025
ml4co_bench_101

(CCF-A) ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs [PDF][Code github-stars]

Jiale Ma, Wenzheng Pan, Yang Li, Junchi Yan

We establishe ML4CO-Bench-101, a standardized benchmark and modular evaluation framework that systematically categorizes, reproduces, and compares neural solvers across seven mainstream graph-based combinatorial optimization problems.

ICML 2025
coexpander

(CCF-A) COExpander: Adaptive Solution Expansion for Combinatorial Optimization [PDF][Code github-stars]

Jiale Ma*, Wenzheng Pan*, Yang Li, Junchi Yan

We introduce COExpander, an adaptive expansion paradigm that bridges global prediction and local construction by progressively determining decision variables with dynamically controlled step sizes for scalable combinatorial optimization.

ICLR 2025
unico

(CCF-A) UniCO: On Unified Combinatorial Optimization via Problem Reduction to Matrix-Encoded General TSP [PDF] [Code github-stars]

Wenzheng Pan*, Hao Xiong*, Jiale Ma, Wentao Zhao, Yang Li, Junchi Yan

We propose UniCO, a unified neural combinatorial optimization framework that reduces diverse COPs into matrix-encoded general TSP and solves them with tailored matrix-based RL and diffusion solvers: 1) MatPOENet, an RL-based sequential model with pseudo one-hot embedding (POE) scheme and 2) MatDIFFNet, a Diffusion-based generative model with the mix-noised reference mapping scheme.

ICLR 2025
ml4tsp-bench

(CCF-A) Unify ML4TSP: Drawing Methodological Principles for TSP and Beyond from Streamlined Design Space of Learning and Search [PDF][Code github-stars]

Yang Li, Jiale Ma, Wenzheng Pan, Runzhong Wang, Haoyu Geng, Nianzu Yang, Junchi Yan

We present ML4TSPBench, a modular framework that decomposes learning-based TSP solvers into reusable learning and search components, revealing key design principles for stronger and more principled ML4CO methods.

JMLR
pygmtools

(CCF-A) Pygmtools: A Python Graph Matching Toolkit [PDF][Code github-stars]

Runzhong Wang, Ziao Guo, Wenzheng Pan, Jiale Ma, Yikai Zhang, Nan Yang, Qi Liu, Longxuan Wei, Hanxue Zhang, Chang Liu, Zetian Jiang, Xiaokang Yang, Junchi Yan

We release Pygmtools, an open-source Python toolkit that unifies classical, multi-graph, and learning-based graph matching solvers across multiple numerical backends for research and practical applications.