Probing Neural Combinatorial Optimization Models
Zhiqin Zhang, Yining Ma, Zhiguang Cao, Hoong Chuin Lau

TL;DR
This paper pioneers the interpretation of neural combinatorial optimization models by analyzing their internal representations with novel probing tools, revealing how they encode information and generalize, which can inform improvements.
Contribution
It introduces Coefficient Significance Probing (CS-Probing), a new method for analyzing NCO models, and provides systematic insights into their learned representations and biases.
Findings
NCO models encode both low-level and high-level information.
Probing reveals model biases and factors influencing generalization.
Minor modifications can improve model generalization.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
