Probing Neural Combinatorial Optimization Models
Zhiqin Zhang, Yining Ma, Zhiguang Cao, Hoong Chuin Lau
Abstract
Neural combinatorial optimization (NCO) has achieved remarkable performance, yet its learned model representations and decision rationale remain a black box. This impedes both academic research and practical deployment, since researchers and stakeholders require deeper insights into NCO models. In this paper, we take the first critical step towards interpreting NCO models by investigating their representations through various probing tasks. Moreover, we introduce a novel probing tool named Coefficient Significance Probing (CS-Probing) to enable deeper analysis of NCO representations by examining the coefficients and statistical significance during probing. Extensive experiments and analysis reveal that NCO models encode low-level information essential for solution construction, while capturing high-level knowledge to facilitate better decisions. Using CS-Probing, we find that prevalent NCO models impose varying inductive biases on their learned representations, uncover direct evidence related to model generalization, and identify key embedding dimensions associated with specific knowledge. These insights can be potentially translated into practice, for example, with minor code modifications, we improve the generalization of the analyzed model. Our work represents a first systematic attempt to interpret black-box NCO models, showcasing probing as a promising tool for analyzing their internal mechanisms and revealing insights for the NCO community. The source code is publicly available 2 .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 6a3b7dbe-3797-4ae6-b773-ee38d6d4142eBuilds on20
- Locating and Editing Factual Associations in GPTKevin Meng, David Bau, Alex Andonian, Yonatan BelinkovNeurIPS 2022 · 3,415 citations
- POMO: Policy Optimization with Multiple Optima for Reinforcement LearningYeong-Dae Kwon, Jinho Choo, Byoungjip Kim, Iljoo Yoon et al.NeurIPS 2020 · 731 citations
- Learning to Dispatch for Job Shop Scheduling via Deep Reinforcement LearningCong Zhang, Wen Song, Zhiguang Cao, Jie Zhang et al.NeurIPS 2020 · 497 citations
- DIFUSCO: Graph-based Diffusion Solvers for Combinatorial OptimizationZhiqing Sun, Yiming YangNeurIPS 2023 · 356 citations
- Language Models Represent Space and TimeWes Gurnee, Max TegmarkICLR 2024 · 303 citations
Related papers
- Towards General Algorithm Discovery for Combinatorial Optimization: Learning Symbolic Branching Policy from Bipartite GraphYufei Kuang, Jie Wang, Yuyan Zhou, Xijun Li et al.ICML 2024 · 4 citations
- Predicting Fine-Tuning Performance with ProbingZining Zhu, Soroosh Shahtalebi, Frank RudziczEMNLP 2022 · 6 citations
- Native Adaptive Solution Expansion for Diffusion-based Combinatorial OptimizationYu Wang, Yang Li, Jiale Ma, Junchi Yan et al.ICLR 2026
- A Latent-Variable Model for Intrinsic ProbingKarolina Stanczak, Lucas Torroba Hennigen, Adina Williams, Ryan Cotterell et al.AAAI 2023 · 6 citations
- Learning Encodings for Constructive Neural Combinatorial Optimization Needs to RegretRui Sun, Zhi Zheng, Zhenkun WangAAAI 2024 · 19 citations
