mlsanityData to 7 Oct 2026

Probing Neural Combinatorial Optimization Models

arXiv 2510.22131 ↗First posted 25 Oct 2025cs.LG cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 37 of its 51 references that are in the map. First posted on arXiv 25 Oct 2025.

Builds on

37 of 51 references.

References · 37

  1. 2022Locating and Editing Factual Associations in GPTcited by 2,609
  2. 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,307
  3. 2016Understanding intermediate layers using linear classifier probescited by 1,279
  4. 2021Probing Classifiers: Promises, Shortcomings, and Advancescited by 831
  5. 2018Attention, Learn to Solve Routing Problems!cited by 646
  6. 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 612
  7. 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 600
  8. 2021Knowledge Neurons in Pretrained Transformerscited by 590
  9. 2017Learning Combinatorial Optimization Algorithms over Graphscited by 557
  10. 2018What you can cram into a single vector: Probing sentence embeddings for linguistic propertiescited by 452
  11. 2022Emergent World Representations: Exploring a Sequence Model Trained on a Synthetic Taskcited by 417
  12. 2019Linguistic Knowledge and Transferability of Contextual Representationscited by 382
25 more
  1. 2020POMO: Policy Optimization with Multiple Optima for Reinforcement Learningcited by 341
  2. 2018Reinforcement Learning for Solving the Vehicle Routing Problemcited by 327
  3. 2023Language Models Represent Space and Timecited by 306
  4. 2023Physics of Language Models: Part 3.1, Knowledge Storage and Extractioncited by 264
  5. 2016Fine-grained Analysis of Sentence Embeddings Using Auxiliary Prediction Taskscited by 216
  6. 2023DIFUSCO: Graph-based Diffusion Solvers for Combinatorial Optimizationcited by 216
  7. 2021Implicit Representations of Meaning in Neural Language Modelscited by 179
  8. 2023Neural Combinatorial Optimization with Heavy Decoder: Toward Large Scale Generalizationcited by 140
  9. 2020Learning to Dispatch for Job Shop Scheduling via Deep Reinforcement Learningcited by 139
  10. 2020Hybrid Genetic Search for the CVRP: Open-Source Implementation and SWAP* Neighborhoodcited by 122
  11. 2021Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformercited by 108
  12. 2021Deep Policy Dynamic Programming for Vehicle Routing Problemscited by 94
  13. 2021Matrix Encoding Networks for Neural Combinatorial Optimizationcited by 89
  14. 2023GLOP: Learning Global Partition and Local Construction for Solving Large-scale Routing Problems in Real-timecited by 82
  15. 2023Learning to Search Feasible and Infeasible Regions of Routing Problems with Flexible Neural k-Optcited by 81
  16. 2023DeepACO: Neural-enhanced Ant Systems for Combinatorial Optimizationcited by 77
  17. 2021What all do audio transformer models hear? Probing Acoustic Representations for Language Delivery and its Structurecited by 52
  18. 2025Fast T2T: Optimization Consistency Speeds Up Diffusion-Based Training-to-Testing Solving for Combinatorial Optimizationcited by 43
  19. 2024Probing the Decision Boundaries of In-context Learning in Large Language Modelscited by 17
  20. 2022Light-weight probing of unsupervised representations for Reinforcement Learningcited by 15
  21. 2024Distance-aware Attention Reshaping: Enhance Generalization of Neural Solver for Large-scale Vehicle Routing Problemscited by 15
  22. 2024What Do Language Models Hear? Probing for Auditory Representations in Language Modelscited by 15
  23. 2023Learning Large Neighborhood Search for Vehicle Routing in Airport Ground Handlingcited by 10
  24. 2023Heuristics for Vehicle Routing Problem: A Survey and Recent Advancescited by 7
  25. 2022Neural Networks for Local Search and Crossover in Vehicle Routing: A Possible Overkill?cited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 3.

3 papers.