👨🏻💻 About Me
I am currently a first-year PHD student with the School of Artificial Intelligence (SAI), Shanghai Jiao Tong University (SJTU) (上海交通大学人工智能学院). I have been a member of ReThinkLab since 2022 and supervised by Prof. Junchi Yan (严骏驰) who leads the lab. I achieved the Bachelor degree from School of Computer Science at SJTU, and transitioned directly to the current PhD program. My research interests lie in machine learning, especially deep generative models and combinatorial optimization on graphs.
📖 Educations
- 2025.09 - now, School of Artificial Intelligence, SJTU (pursuing the PHD’s Degree)
- 2021.09 - 2025.06, School of Computer Science, SJTU (B.E. Degree obtained)
- Overall:
- Courses:
- Overall:
🏆 Honors and Awards
- 2025.06 Outstanding Graduate of Shanghai (上海市优秀毕业生 top 3% citywide)
- 2024.12 First-Class Cybersecurity Scholarship (一流网安奖学金 top 10% in Dept.)
- 2022.12 National Scholarship for Undergraduate Stuedent (本科生国家奖学金 top 0.2% nationwide)
- 2022.12 First-class Academic Scholarship of SJTU (上海交通大学A等优秀奖学金 top 1% in SJTU)
- 2022.10 Merit Student of Shanghai Jiao Tong University (上海交通大学三好学生 top 8% in SJTU)
🔥 News
- 2026.05: 🔍 I served as a reviewer for NeurIPS 2026!
- 2026.05: 🎉 One paper was accepted by ICML 2026!
- 2026.02: 🔍 I served as a reviewer for ICML 2026!
- 2026.01: 🎉 One paper was accepted by ICLR 2026!
- 2025.10: 🔍 I served as a reviewer for ICLR 2026 and AAMAS 2026!
- 2025.09: 🎉 One paper was accepted by NeurIPS 2025!
- 2025.05: 🎉 Two papers were accepted by ICML 2025!
- 2025.01: 🎉 Two papers were accepted by ICLR 2025!
- 2024.10: 🔍 I served as a reviewer for ICLR 2025!
- 2024.01: 🎉 One paper was accepted by JMLR!
📝 Publications

Wenzheng Pan, Jiale Ma, Nuoyan Chen, Yang Li, Junchi Yan, International Conference on Machine Learning (ICML), 2026. [Code]
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.

NExCO: Native Solution Expansion for Diffusion-based Combinatorial Optimization
Yu Wang, Yang Li, Jiale Ma, Junchi Yan, Yi Chang, International Conference on Learning Representations (ICLR), 2026. [Code]
We propose NExCO, a masked diffusion framework that realizes adaptive solution expansion as a native generative principle for neural combinatorial optimization. Our framework is built on three key components: a CO-specific forward corruption that preserves sparsity and yields semantic partial solutions, a time-agnostic GNN denoiser trained under optimization consistency, and a Native Adaptive Expansion (NAE) inference strategy that progressively selects confident variables under feasibility constraints.

ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs
Jiale Ma, Wenzheng Pan, Yang Li, Junchi Yan, Advances in Neural Information Processing Systems (NeurIPS), 2025. [Code]
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 problems.

Yang Li, Jiale Ma, Yebin Yang, Qitian Wu, Hongyuan Zha, Junchi Yan, International Conference on Machine Learning (ICML), 2025. [Code]
We propose a novel predictive consistency learning framework beyond previous methods with direct prediction, aiming to explore the full potential of label information for supervision during the learning process.

COExpander: Adaptive Solution Expansion for Combinatorial Optimization
Jiale Ma*, Wenzheng Pan*, Yang Li, Junchi Yan, International Conference on Machine Learning (ICML), 2025. [Code]
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.

UniCO: On Unified Combinatorial Optimization via Problem Reduction to Matrix-Encoded General TSP
Wenzheng Pan*, Hao Xiong*, Jiale Ma, Wentao Zhao, Yang Li, Junchi Yan, International Conference on Learning Representations (ICLR), 2025. [Code]
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.

Yang Li, Jiale Ma, Wenzheng Pan, Runzhong Wang, Haoyu Geng, Nianzu Yang, Junchi Yan, International Conference on Learning Representations (ICLR), 2025. [Code]
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.

Pygmtools: A Python Graph Matching Toolkit
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, Journal of Machine Learning Research (JMLR), 2024. [Code]
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.
⚙️ Open Source Projects
ML4CO-Kit: A Python toolkit for Machine Learning practices for Combinatorial Optimization
A general-purpose toolkit that provides implementations of common algorithms used in ML4CO, along with basic training frameworks, traditional solvers and data generation tools. It aims to simplify the implementation of key techniques and offer a solid base for developing machine learning models for COPs.
ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs
A benchmark that categorizes neural combinatorial optimization (NCO) solvers by solving paradigms, model designs, and learning strategies. It evaluates applicability and generalization of different NCO approaches across a broad range of combinatorial optimization problems to uncover universal insights that can be transferred across various domains of ML4CO.
A Python graph matching toolkit that implements a comprehensive collection of two-graph matching and multi-graph matching solvers, covering both learning-free solvers as well as learning-based neural graph matching solvers. Our implementation supports numerical backends including Numpy, PyTorch, Jittor, Paddle, runs on Windows, MacOS and Linux, and is friendly to install and configure.