Generalization Bounds of Surrogate Policies for Combinatorial Optimization Problems.
Pierre-Cyril Aubin-FrankowskiYohann De CastroAxel ParmentierAlessandro RudiPublished in: CoRR (2024)
Keyphrases
- combinatorial optimization problems
- generalization bounds
- learning theory
- data dependent
- generalization ability
- optimization problems
- knapsack problem
- combinatorial optimization
- metaheuristic
- ranking algorithm
- ant colony optimization
- linear classifiers
- model selection
- vc dimension
- statistical learning theory
- traveling salesman problem
- learning problems
- vehicle routing problem
- ranking functions
- support vector machine
- learning machines
- genetic algorithm
- support vector machine svm
- simulated annealing
- multi class
- evolutionary algorithm
- statistical learning
- computational complexity
- support vector
- optimal solution
- learning algorithm