SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Adaptive Bound Optimization for Online Convex Optimization
3 references·8 citing·25 second hop
Adaptive Bound Optimization for Online Convex Optimization (2010)Adaptive Bound Optimization for Online Co…Prediction, Learning, and Games (2006)Prediction, Learning, and Gam…Efficient algorithms for online decision problems (2004)Efficient algorithms for onli…Online convex programming and generalized infinitesimal gradient ascent (2003)Online convex programming and…A Deep Learning Algorithm for High-Dimensional Exploratory Item Factor Analysis (2021)A Deep Learning Algorithm for…Online Learning: A Modern Introduction Using Convex Optimization (2019)Online Learning: A Modern Int…Scale-free online learning (2017)Scale-free online learningAdaptive algorithms for online convex optimization with long-term constraints (2016)Adaptive algorithms for onlin…Adaptivity and Optimism: An Improved Exponentiated Gradient Algorithm (2014)Adaptivity and Optimism: An I…A generalized online mirror descent with applications to classification and regression (2014)A generalized online mirror d…Normalized Online Learning (2013)Normalized Online LearningBig Data Exploration Via Automated Orchestration of Analytic Workflows. (2013)Big Data Exploration Via Auto…A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Theory of games and economic behavior (2019)Using data mining for bank direct marketing: an application of the CRISP-DM methodology (2011)Practical Bayesian Optimization of Machine Learning Algorithms (2012)Online Learning and Online Convex Optimization (2011)Online Learning and Online Convex Optimization (2012)The Theory of Learning in Games (1998)Ad click prediction (2013)Contributions to the theory of games. (1960)How to use expert advice (1997)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)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)A Stochastic Approximation Method (1951)The development of markers for the Big-Five factor structure. (1992)Sample size in factor analysis. (1999)An analog of the minimax theorem for vector payoffs (1956)Exponentiated Gradient versus Gradient Descent for Linear Predictors (1997)Second-order Quantile Methods for Experts and Combinatorial Games (2015)Online Convex Optimization with Time-Varying Constraints (2017)Distributed Online Linear Regressions (2020)Distributed Online Optimization With Long-Term Constraints (2021)Answering the Queen: Machine Learning and Financial Crises (2020)
this work references cited by second hop

References

  • 2006Prediction, Learning, and Games3,176 cited
  • 2003Online convex programming and generalized infinitesimal gradient ascent1,733 cited
  • 2004Efficient algorithms for online decision problems595 cited

Cited by

  • 2019Online Learning: A Modern Introduction Using Convex Optimization111 cited
  • 2016Adaptive algorithms for online convex optimization with long-term constraints89 cited
  • 2014A generalized online mirror descent with applications to classification and regression54 cited
  • 2013Normalized Online Learning49 cited
  • 2017Scale-free online learning48 cited
  • 2014Adaptivity and Optimism: An Improved Exponentiated Gradient Algorithm46 cited
  • 2021A Deep Learning Algorithm for High-Dimensional Exploratory Item Factor Analysis45 cited
  • 2013Big Data Exploration Via Automated Orchestration of Analytic Workflows.8 cited

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