Refined bounds for algorithm configuration: The knife-edge of dual class approximability.
Maria-Florina BalcanTuomas SandholmEllen VitercikPublished in: CoRR (2020)
Keyphrases
- worst case
- segmentation algorithm
- np hard
- optimal solution
- experimental evaluation
- multi class classification
- k means
- significant improvement
- computational cost
- dynamic programming
- matching algorithm
- detection algorithm
- optimization algorithm
- theoretical analysis
- linear programming
- convergence rate
- special case
- search space
- primal dual
- objective function
- error bounds
- recognition algorithm
- learning algorithm
- edge points
- simulated annealing
- cost function
- preprocessing
- computational complexity
- image segmentation
- decision trees