SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Adaptive Algorithms for Online Decision Problems
9 references·3 citing·39 second hop
Adaptive Algorithms for Online Decision Problems (2007)Adaptive Algorithms for Online Decision P…Prediction, Learning, and Games (2006)Prediction, Learning, and Gam…Logarithmic Regret Algorithms for Online Convex Optimization (2006)Logarithmic Regret Algorithms…Efficient algorithms for online decision problems (2004)Efficient algorithms for onli…Online convex programming and generalized infinitesimal gradient ascent (2003)Online convex programming and…Efficient algorithms for universal portfolios (2002)Efficient algorithms for univ…Tracking a Small Set of Experts by Mixing Past Posteriors (2001)Tracking a Small Set of Exper…Tracking the Best Expert (1998)Tracking the Best ExpertThe Cost of Achieving the Best Portfolio in Hindsight (1998)The Cost of Achieving the Bes…A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)A Decision-Theoretic Generali…Learning and Efficiency in Games with Dynamic Population (2015)Learning and Efficiency in Ga…Achieving All with No Parameters: AdaNormalHedge (2015)Achieving All with No Paramet…Efficient Tracking of Large Classes of Experts (2012)Efficient Tracking of Large C…Online convex optimization in the bandit setting: gradient descent without a gradient (2004)Adaptive Online Gradient Descent (2007)Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints (2011)Online ARIMA Algorithms for Time Series Prediction (2016)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)Exponentiated Gradient versus Gradient Descent for Linear Predictors (1997)How to use expert advice (1997)A Game of Prediction with Expert Advice (1998)On Upper-Confidence Bound Policies for Switching Bandit Problems (2011)Online portfolio selection (2014)An analog of the minimax theorem for vector payoffs (1956)Brownian Motion and Stochastic Calculus. (1989)Dynamic Asset Pricing Theory. (1993)Internal Regret in On-Line Portfolio Selection (2005)Online trading algorithms and robust option pricing (2006)Online Portfolio Selection: A Survey (2012)Universal Portfolios (1991)Universal portfolios with side information (1996)On‐Line Portfolio Selection Using Multiplicative Updates (1998)Introduction to Online Optimization (2011)Confidence Weighted Mean Reversion Strategy for Online Portfolio Selection (2013)Robust Median Reversion Strategy for Online Portfolio Selection (2016)The Theory of Learning in Games (1998)Ad click prediction (2013)Contributions to the theory of games. (1960)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)The Nonstochastic Multiarmed Bandit Problem (2002)Survey on speech emotion recognition: Features, classification schemes, and databases (2010)Efficient learning algorithms for changing environments (2009)Learning Permutations with Exponential Weights (2009)Hedging structured concepts (2010)Learning to Bid Without Knowing your Value (2018)Routing Games in the Wild: Efficiency, Equilibration, Regret, and a Price of Anarchy Bound via Long Division (2022)
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
  • 2003Online convex programming and generalized infinitesimal gradient ascent1,733 cited
  • 2004Efficient algorithms for online decision problems595 cited
  • 1998Tracking the Best Expert557 cited
  • 2006Logarithmic Regret Algorithms for Online Convex Optimization203 cited
  • 2002Efficient algorithms for universal portfolios139 cited
  • 2001Tracking a Small Set of Experts by Mixing Past Posteriors124 cited
  • 1998The Cost of Achieving the Best Portfolio in Hindsight91 cited

Cited by

  • 2015Learning and Efficiency in Games with Dynamic Population56 cited
  • 2015Achieving All with No Parameters: AdaNormalHedge54 cited
  • 2012Efficient Tracking of Large Classes of Experts40 cited

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