Weighted Last-Step Min-Max Algorithm with Improved Sub-Logarithmic Regret
Edward MoroshkoKoby CrammerPublished in: CoRR (2013)
Keyphrases
- min max
- improved algorithm
- worst case
- learning algorithm
- dynamic programming
- cost function
- significant improvement
- optimization algorithm
- experimental evaluation
- max min
- times faster
- detection algorithm
- probabilistic model
- objective function
- preprocessing
- high accuracy
- simulated annealing
- online learning
- regret bounds
- computational complexity
- max cut
- multiobjective optimization
- neural network
- feature selection
- matching algorithm
- linear programming
- similarity measure
- search algorithm
- multi objective