Neural Tractability via Structure: Learning-Augmented Algorithms for Graph Combinatorial Optimization
cs.LG, stat.ML
Submitted: 2025-11-24
Updated: 2026-09-27
Terminology
Sources
- Max-Cut with $\epsilon$-Accurate Predictions
- GFlowNet Foundations
- Learning What to Defer for Maximum Independent Sets
- DISCO: Efficient Diffusion Solver for Large-Scale Combinatorial Optimization Problems
- A Complete Anytime Algorithm for Treewidth
- Learning to Branch in Combinatorial Optimization with Graph Pointer Networks
- Attention, Learn to Solve Routing Problems!
- A Diffusion Model Framework for Unsupervised Neural Combinatorial Optimization
- A GNN-Guided Predict-and-Search Framework for Mixed-Integer Linear Programming
- Neural Combinatorial Optimization with Reinforcement Learning
- Causal Discovery with Reinforcement Learning
- No Representation, No Trust: Connecting Representation, Collapse, and Trust Issues in PPO
- Learning-Augmented Streaming Algorithms for Approximating MAX-CUT
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks