Designing smoothing functions for improved worst-case competitive ratio in online optimization.
Reza EghbaliMaryam FazelPublished in: NIPS (2016)
Keyphrases
- online algorithms
- competitive ratio
- worst case
- average case
- online learning
- lower bound
- monte carlo sampling
- learning algorithm
- upper bound
- greedy algorithm
- optimization problems
- approximation algorithms
- np hard
- sample size
- combinatorial optimization
- branch and bound
- uniform distribution
- decision boundary
- linear space
- search algorithm
- machine learning