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