Refined bounds for algorithm configuration: The knife-edge of dual class approximability.
Maria-Florina BalcanTuomas SandholmEllen VitercikPublished in: ICML (2020)
Keyphrases
- significant improvement
- dynamic programming
- preprocessing
- computational complexity
- np hard
- computational cost
- learning algorithm
- multi class classification
- detection algorithm
- segmentation algorithm
- theoretical analysis
- worst case
- objective function
- cost function
- simulated annealing
- linear programming
- k means
- optimal solution
- confidence bounds
- experimental evaluation
- expectation maximization
- segmentation method
- error bounds
- lower and upper bounds
- genetic algorithm