Algorithm Selection as a Bandit Problem with Unbounded Losses.
Matteo GaglioloJürgen SchmidhuberPublished in: LION (2010)
Keyphrases
- selection algorithm
- dynamic programming
- high accuracy
- detection algorithm
- learning algorithm
- k means
- theoretical analysis
- cost function
- np hard
- computational cost
- optimization algorithm
- simulated annealing
- matching algorithm
- estimation algorithm
- recognition algorithm
- experimental study
- particle swarm optimization
- computational complexity
- expectation maximization
- state space
- experimental evaluation