The Follow Perturbed Leader Algorithm Protected from Unbounded One-Step Losses
From MaRDI portal
Publication:3648741
Recommendations
- Online learning in case of unbounded losses using follow the perturbed leader algorithm
- Algorithmic Learning Theory
- Adaptive online prediction by following the perturbed leader
- Learning Theory
- Leader-following almost output consensus for linear multi-agent systems with disturbance-affected unstable zero dynamics
- scientific article; zbMATH DE number 6961442
- Algorithmic Learning Theory
- Leader-following consensus with connectivity preservation of uncertain Euler-Lagrange multi-agent systems
- Adaptive leader-following consensus for uncertain nonlinear multi-agent systems
- Leaderless adaptive output feedback consensus approach for one-sided Lipschitz multi-agents
Cites work
- scientific article; zbMATH DE number 3128728 (Why is no real title available?)
- scientific article; zbMATH DE number 3504209 (Why is no real title available?)
- Algorithmic Learning Theory
- Algorithmic Learning Theory
- Efficient algorithms for online decision problems.
- Hannan Consistency in On-Line Learning in Case of Unbounded Losses Under Partial Monitoring
- Improved second-order bounds for prediction with expert advice
- Prediction, Learning, and Games
- The weighted majority algorithm
Cited in
(6)- Learning Volatility of Discrete Time Series Using Prediction with Expert Advice
- Adaptive online prediction by following the perturbed leader
- On minimaxity of follow the leader strategy in the stochastic setting
- Algorithmic Learning Theory
- Hannan Consistency in On-Line Learning in Case of Unbounded Losses Under Partial Monitoring
- Online learning in case of unbounded losses using follow the perturbed leader algorithm
This page was built for publication: The Follow Perturbed Leader Algorithm Protected from Unbounded One-Step Losses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3648741)