Efficient algorithms for online decision problems.
From MaRDI portal
Recommendations
Cited in
(24)- Logarithmic regret algorithms for online convex optimization
- Agendas for multi-agent learning
- Randomized prediction of individual sequences
- Regret in the on-line decision problem
- Linear programming with online learning
- Efficient algorithms for online decision problems
- Non-stationary stochastic optimization
- Unified algorithms for online learning and competitive analysis
- Learning hurdles for sleeping experts
- Learning hurdles for sleeping experts
- Offline to online conversion
- Sequential decision making with vector outcomes
- Making online decisions with bounded memory
- scientific article; zbMATH DE number 437568 (Why is no real title available?)
- The on-line shortest path problem under partial monitoring
- Following the Perturbed Leader to Gamble at Multi-armed Bandits
- Learning Volatility of Discrete Time Series Using Prediction with Expert Advice
- The Follow Perturbed Leader Algorithm Protected from Unbounded One-Step Losses
- Better algorithms for benign bandits
- Efficient transductive online learning via randomized rounding
- The Shortest Path Problem Under Partial Monitoring
- Logarithmic Regret Algorithms for Online Convex Optimization
- Algorithmic Learning Theory
- Online submodular minimization
This page was built for publication: Efficient algorithms for online decision problems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5305839)
