Research map / Learning theory and algorithms / Combinatorial and search optimization
Matrix encoding networks for neural combinatorial optimization
Yeong-Dae Kwon, Jinho Choo, Iljoo Yoon, Minah Park, Duwon Park, Youngjune Gwon
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use instance augmentation (random one-hot assignments) instead of sampling at inference, x128 (ablation) | MatNet · ATSP100 | gap to CPLEX: 1.89% -> 0.93% | Improved |
| use instance augmentation x128 instead of sampling x128 (ablation) | MatNet · ATSP20 | gap to CPLEX: 0.22% -> 0.01% | Improved |
| increase sampling rollouts from 128 to 1280 (ablation) | MatNet · ATSP100 | gap to CPLEX: 1.89% -> 1.58% | Improved |
| use single shared update function for both groups (ablation) | MatNet · ATSP100 | tour length: 1.621 -> 1.623 | No clear effect |
| use single shared update function for both groups (ablation) | MatNet · FFSP100 | makespan: 91.529 -> 91.680 | Hurt |
| use x128 instance augmentation instead of single POMO rollout (ablation) | MatNet · FFSP100 | makespan: 91.5 -> 89.7 | Improved |
| include graph embedding in QUERY token (ablation) | MatNet · ATSP | gap | No clear effect |
| replace one-hot initial embeddings with random vectors (ablation) | MatNet · ATSP/FFSP | solution quality | Hurt |
| MatNet vs best OR metaheuristic (PSO) on FFSP100 | MatNet · FFSP100 | makespan: 97.3 -> 91.5 | Improved |
Closest papers by meaning
- Geometric Algorithms for Neural Combinatorial Optimization with Constraints (NeurIPS 2025 · similarity 0.88)
- COMBHelper: A Neural Approach to Reduce Search Space for Graph Combinatorial Problems (AAAI 2024 · similarity 0.87)
- Neural Solver Selection for Combinatorial Optimization (ICML 2025 · similarity 0.87)
- Are Graph Neural Networks Optimal Approximation Algorithms? (NeurIPS 2024 · similarity 0.86)
- GOAL: A Generalist Combinatorial Optimization Agent Learner (ICLR 2025 · similarity 0.86)
- PolyNet: Learning Diverse Solution Strategies for Neural Combinatorial Optimization (ICLR 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
