Efficient algorithms for linear polyhedral bandits

Keyphrases

• Polyhedron 100%
• Regret Bounds 100%
• Polyhedral 100%
• Bandits 100%
• Adaptation 50%
• Regret 50%
• Linear Optimization Problem 50%
• Exploration Phase 50%
• Estimation Error 50%
• Convergence Results 50%
• Logarithmic Regret 50%
• Small Perturbation 50%
• Reward Function 50%
• Weak Convergence 50%
• Numerical Investigation 50%
• Bandit Feedback 50%
• Linear Inequalities 50%
• Stochastic Linear Optimization 50%
• Expected Regret 50%
• N-dimensional Space 50%

Mathematics

• Polyhedron 100%
• Probability Theory 100%
• Stochastics 50%
• Asymptotics 50%
• Convergence Result 50%
• Dimensional Space 50%
• Finite Time 50%
• Weak Convergence 50%
• Linear Inequality 50%