Competing in the dark: An efficient algorithm for bandit linear optimization

Keyphrases

• Linear Optimization 100%
• Bandits 100%
• Optimal Algorithm 50%
• Multi-armed Bandit Problem 50%
• Interior Point Method 50%
• Online Learning 50%
• Regret 50%
• Online Linear Optimization 50%
• Non-stochastic 50%
• Stochastic multi-armed Bandits 50%
• Learning Points 50%

Mathematics

• Stochastics 100%
• Open Problem 100%
• Potential Function 100%
• Interior Point 100%
• Natural Generalization 100%

Computer Science

• Efficient Algorithm 100%
• Linear Optimization 100%
• Online Learning 50%
• Optimal Algorithm 50%
• Potential Function 50%
• Interior-Point Method 50%