Neural Tractability via Structure: Learning-Augmented Algorithms for Graph Combinatorial Optimization
The proposed Neural Fixed-Parameter Tractable (N-FPT), a neural-model-agnostic framework that uses parameterized algorithms to improve neural solutions without retraining and guide learning, proves this guarantee and global optimality under perfect advice.