Learning Theory

DOI10.1007/B98522zbMATH Open1078.68128OpenAlexW4206057230MaRDI QIDQ4680919FDOQ4680919

Authors: H. Brendan McMahan, Avrim Blum 

Publication date: 13 June 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b98522

Recommendations

• Online convex optimization in the bandit setting: gradient descent without a gradient
• Algorithmic Learning Theory
• Online linear optimization and adaptive routing
• Better algorithms for benign bandits
• scientific article; zbMATH DE number 6253908

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Sequential statistical design (62L05)

Cited In (14)

• On two continuum armed bandit problems in high dimensions
• Combinatorial bandits
• Algorithmic Learning Theory
• Following the Perturbed Leader to Gamble at Multi-armed Bandits
• Bandit online optimization over the permutahedron
• Perspectives on multiagent learning
• Non-stationary stochastic optimization
• Online convex optimization in the bandit setting: gradient descent without a gradient
• Randomized prediction of individual sequences
• Efficient algorithms for online decision problems
• Nonstochastic bandits: Countable decision set, unbounded costs and reactive environments
• Online linear optimization and adaptive routing
• Stochastic continuum-armed bandits with additive models: minimax regrets and adaptive algorithm
• Adaptive routing with end-to-end feedback: distributed learning and geometric approaches

This page was built for publication: Learning Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680919)