Identifying Easy Instances to Improve Efficiency of ML Pipelines for Algorithm-Selection.
Quentin RenauEmma HartPublished in: CoRR (2024)
Keyphrases
- computational complexity
- learning algorithm
- randomly generated
- optimal solution
- times faster
- optimization algorithm
- np hard
- dynamic programming
- estimation algorithm
- high efficiency
- convex hull
- preprocessing
- detection algorithm
- significant improvement
- cost function
- experimental evaluation
- segmentation algorithm
- k means
- selection algorithm
- recognition algorithm
- computational efficiency
- improved algorithm
- highly efficient
- search algorithm
- knapsack problem
- particle swarm optimization
- computational cost
- ant colony optimization
- maximum likelihood
- linear programming
- probabilistic model
- selection strategy
- lower and upper bounds
- initial solution