SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Learning Permutations with Exponential Weights
11 references·4 citing·29 second hop
Learning Permutations with Exponential Weights (2009)Learning Permutations with Exponential We…Randomized Online PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension (2008)Randomized Online PCA Algorit…Prediction, Learning, and Games (2006)Prediction, Learning, and Gam…Efficient algorithms for online decision problems (2004)Efficient algorithms for onli…The Nonstochastic Multiarmed Bandit Problem (2002)The Nonstochastic Multiarmed …Tracking a Small Set of Experts by Mixing Past Posteriors (2001)Tracking a Small Set of Exper…Relative Loss Bounds for On-Line Density Estimation with the Exponential Family of Distributions (2001)Relative Loss Bounds for On-L…Averaging Expert Predictions (1999)Averaging Expert PredictionsTracking the Best Expert (1998)Tracking the Best ExpertHow to use expert advice (1997)How to use expert adviceExponentiated Gradient versus Gradient Descent for Linear Predictors (1997)Exponentiated Gradient versus…A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)A Decision-Theoretic Generali…Scale-free online learning (2017)Scale-free online learningSecond-order Quantile Methods for Experts and Combinatorial Games (2015)Second-order Quantile Methods…Efficient Market Making via Convex Optimization, and a Connection to Online Learning (2013)Efficient Market Making via C…Minimax Policies for Combinatorial Prediction Games (2011)Minimax Policies for Combinat…An analog of the minimax theorem for vector payoffs (1956)A primal-dual perspective of online learning algorithms (2007)Online Learning: Theory, Algorithms, and Applications (2007)Online Convex Optimization in Dynamic Environments (2015)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)Contributions to the theory of games. (1960)The Asymptotic Theory of Extreme Order Statistics (1990)Adaptive Game Playing Using Multiplicative Weights (1999)Some aspects of the sequential design of experiments (1952)Online convex programming and generalized infinitesimal gradient ascent (2003)Algorithms for portfolio management based on the Newton method (2006)Combinatorial bandits (2012)From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning (2014)Potential-Based Algorithms in On-Line Prediction and Game Theory (2003)Online Learning: A Modern Introduction Using Convex Optimization (2019)A Game of Prediction with Expert Advice (1998)On Upper-Confidence Bound Policies for Switching Bandit Problems (2011)Online portfolio selection (2014)Survey on speech emotion recognition: Features, classification schemes, and databases (2010)Online convex optimization in the bandit setting: gradient descent without a gradient (2004)Introduction to Online Convex Optimization (2016)Introduction to Online Convex Optimization (2016)Efficient learning algorithms for changing environments (2009)Hedging structured concepts (2010)Strongly Adaptive Online Learning (2015)
this work references cited by second hop

References

  • 1997A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting20,469 cited
  • 2006Prediction, Learning, and Games3,176 cited
  • 2002The Nonstochastic Multiarmed Bandit Problem2,210 cited
  • 1997Exponentiated Gradient versus Gradient Descent for Linear Predictors856 cited
  • 1997How to use expert advice631 cited
  • 2004Efficient algorithms for online decision problems595 cited
  • 1998Tracking the Best Expert557 cited
  • 2001Relative Loss Bounds for On-Line Density Estimation with the Exponential Family of Distributions297 cited
  • 1999Averaging Expert Predictions131 cited
  • 2001Tracking a Small Set of Experts by Mixing Past Posteriors124 cited
  • 2008Randomized Online PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension121 cited

Cited by

  • 2013Efficient Market Making via Convex Optimization, and a Connection to Online Learning75 cited
  • 2011Minimax Policies for Combinatorial Prediction Games50 cited
  • 2017Scale-free online learning48 cited
  • 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