SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Optimal learning with Bernstein online aggregation
11 references·1 citing·38 second hop
Optimal learning with Bernstein online aggregation (2016)Optimal learning with Bernstein online ag…Achieving All with No Parameters: AdaNormalHedge (2015)Achieving All with No Paramet…A Second-order Bound with Excess Losses (2014)A Second-order Bound with Exc…The Generalization Ability of Online Algorithms for Dependent Data (2012)The Generalization Ability of…Extracting certainty from uncertainty: regret bounded by variation in costs (2010)Extracting certainty from unc…A Stochastic View of Optimal Regret through Minimax Duality (2009)A Stochastic View of Optimal …On the Generalization Ability of Online Strongly Convex Programming Algorithms (2008)On the Generalization Ability…Prediction, Learning, and Games (2006)Prediction, Learning, and Gam…Improved second-order bounds for prediction with expert advice (2006)Improved second-order bounds …From External to Internal Regret (2005)From External to Internal Reg…Sequential prediction of individual sequences under general loss functions (1998)Sequential prediction of indi…AGGREGATING STRATEGIES (1990)AGGREGATING STRATEGIESSecond-order Quantile Methods for Experts and Combinatorial Games (2015)Second-order Quantile Methods…A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Online Learning and Online Convex Optimization (2011)Online Learning and Online Convex Optimization (2012)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Theory of games and economic behavior (2019)Adaptive Online Gradient Descent (2007)Optimal Strategies and Minimax Lower Bounds for Online Convex Games (2008)Online Learning: Beyond Regret (2010)Blackwell Approachability and No-Regret Learning are Equivalent (2011)An Information-Theoretic Approach to Minimax Regret in Partial Monitoring (2019)The Nonstochastic Multiarmed Bandit Problem (2002)A parameter-free hedging algorithm (2009)A new understanding of prediction markets via no-regret learning (2010)Online Learning: A Modern Introduction Using Convex Optimization (2019)Subjectivity and correlation in randomized strategies (1974)No-regret learning in convex games (2008)A Tutorial on Interactive Sensing in Social Networks (2014)Learning and Efficiency in Games with Dynamic Population (2015)Stochastic Approximation and Recursive Algorithms and Applications (2003)Logarithmic regret algorithms for online convex optimization (2007)Learning theory and algorithms for forecasting non-stationary time series (2015)Logarithmic Regret Algorithms for Online Convex Optimization (2006)Multiclass classification with bandit feedback using adaptive regularization (2012)A Contextual Bandit Bake-off (2018)The Asymptotic Theory of Extreme Order Statistics (1990)Exponentiated Gradient versus Gradient Descent for Linear Predictors (1997)Averaging Expert Predictions (1999)Tracking a Small Set of Experts by Mixing Past Posteriors (2001)Gambling in a rigged casino: The adversarial multi-armed bandit problem (2002)Potential-Based Algorithms in On-Line Prediction and Game Theory (2003)Theory of Games and Statistical Decisions (1955)Regret bounds for sleeping experts and bandits (2010)Evolutionary Game Theory: A Renaissance (2018)Learning in games with continuous action sets and unknown payoff functions (2018)Online Optimization with Gradual Variations (2012)The best of both worlds: stochastic and adversarial bandits (2012)Refined Lower Bounds for Adversarial Bandits (2016)
this work references cited by second hop

References

  • 2006Prediction, Learning, and Games3,176 cited
  • 1990AGGREGATING STRATEGIES326 cited
  • 1998Sequential prediction of individual sequences under general loss functions160 cited
  • 2006Improved second-order bounds for prediction with expert advice154 cited
  • 2010Extracting certainty from uncertainty: regret bounded by variation in costs113 cited
  • 2008On the Generalization Ability of Online Strongly Convex Programming Algorithms113 cited
  • 2009A Stochastic View of Optimal Regret through Minimax Duality79 cited
  • 2014A Second-order Bound with Excess Losses67 cited
  • 2012The Generalization Ability of Online Algorithms for Dependent Data66 cited
  • 2005From External to Internal Regret66 cited
  • 2015Achieving All with No Parameters: AdaNormalHedge54 cited

Cited by

  • 2015Second-order Quantile Methods for Experts and Combinatorial Games42 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work