SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
A Survey of Algorithms and Analysis for Adaptive Online Learning
16 references·0 citing·30 second hop
A Survey of Algorithms and Analysis for Adaptive Online Learning (2014)A Survey of Algorithms and Analysis for A…Unconstrained Online Linear Learning in Hilbert Spaces: Minimax Algorithms and Normal Approximations (2014)Unconstrained Online Linear L…Ad click prediction (2013)Ad click predictionOnline Learning and Online Convex Optimization (2011)Online Learning and Online Co…Implicit Online Learning (2010)Implicit Online LearningExtracting certainty from uncertainty: regret bounded by variation in costs (2010)Extracting certainty from unc…Adaptive Bound Optimization for Online Convex Optimization (2010)Adaptive Bound Optimization f…Mind the Duality Gap: Logarithmic regret algorithms for online optimization (2008)Mind the Duality Gap: Logarit…Online Learning: Theory, Algorithms, and Applications (2007)Online Learning: Theory, Algo…Logarithmic regret algorithms for online convex optimization (2007)Logarithmic regret algorithms…Adaptive Online Gradient Descent (2007)Adaptive Online Gradient Desc…A primal-dual perspective of online learning algorithms (2007)A primal-dual perspective of …Incomplete information and internal regret in prediction of individual sequences (2005)Incomplete information and in…Online convex programming and generalized infinitesimal gradient ascent (2003)Online convex programming and…Regret bounds for prediction problems (1999)Regret bounds for prediction …Exponentiated 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…Efficient algorithms for online decision problems (2004)Prediction, Learning, and Games (2006)A generalized online mirror descent with applications to classification and regression (2014)Adaptive algorithms for online convex optimization with long-term constraints (2016)Online Learning: A Modern Introduction Using Convex Optimization (2019)Contributions to the Theory of Games. (1959)Relative Loss Bounds for On-Line Density Estimation with the Exponential Family of Distributions (2001)Efficient bandit algorithms for online multiclass prediction (2008)A new understanding of prediction markets via no-regret learning (2010)Interior-Point Methods for Full-Information and Bandit Online Learning (2012)Some aspects of the sequential design of experiments (1952)The Nonstochastic Multiarmed Bandit Problem (2002)A general approach for predicting the behavior of the Supreme Court of the United States (2017)Logarithmic Regret Algorithms for Online Convex Optimization (2006)Efficient Optimal Learning for Contextual Bandits (2011)Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints (2011)Online Learning with Predictable Sequences (2012)The Theory of Learning in Games (1998)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)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)The Operational Value of Social Media Information (2015)Real-Time Bidding by Reinforcement Learning in Display Advertising (2017)Targeting and Privacy in Mobile Advertising (2018)On the Universality of Online Mirror Descent (2011)Regret in Online Combinatorial Optimization (2013)Learning in games with continuous action sets and unknown payoff functions (2018)Non-Stationary Stochastic Optimization (2015)
this work references cited by second hop

References

  • 1997A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting20,469 cited
  • 2003Online convex programming and generalized infinitesimal gradient ascent1,733 cited
  • 2011Online Learning and Online Convex Optimization1,095 cited
  • 2013Ad click prediction870 cited
  • 1997Exponentiated Gradient versus Gradient Descent for Linear Predictors856 cited
  • 2007Logarithmic regret algorithms for online convex optimization836 cited
  • 2007Online Learning: Theory, Algorithms, and Applications297 cited
  • 2010Adaptive Bound Optimization for Online Convex Optimization228 cited
  • 2007Adaptive Online Gradient Descent180 cited
  • 2007A primal-dual perspective of online learning algorithms169 cited
  • 2010Extracting certainty from uncertainty: regret bounded by variation in costs113 cited
  • 1999Regret bounds for prediction problems105 cited
  • 2005Incomplete information and internal regret in prediction of individual sequences87 cited
  • 2008Mind the Duality Gap: Logarithmic regret algorithms for online optimization84 cited
  • 2010Implicit Online Learning60 cited
  • 2014

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

Unconstrained Online Linear Learning in Hilbert Spaces: Minimax Algorithms and Normal Approximations
33 cited

Cited by

No citing works inside the corpus for this window.