SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Exponentiated Gradient versus Gradient Descent for Linear Predictors
0 references·16 citing·39 second hop
Exponentiated Gradient versus Gradient Descent for Linear Predictors (1997)Exponentiated Gradient versus Gradient De…Online Decision Making with High-Dimensional Covariates (2019)Online Decision Making with H…Introduction to Online Convex Optimization (2016)Introduction to Online Convex…Introduction to Online Convex Optimization (2016)Introduction to Online Convex…Efficient bandit algorithms for online multiclass prediction (2008)Efficient bandit algorithms f…Competing in the dark: An efficient algorithm for bandit linear optimization (2008)Competing in the dark: An eff…Online Learning: Theory, Algorithms, and Applications (2007)Online Learning: Theory, Algo…A primal-dual perspective of online learning algorithms (2007)A primal-dual perspective of …Online convex optimization in the bandit setting: gradient descent without a gradient (2004)Online convex optimization in…Adaptive and self-confident on-line learning algorithms (2002)Adaptive and self-confident o…Relative Loss Bounds for On-Line Density Estimation with the Exponential Family of Distributions (2001)Relative Loss Bounds for On-L…Competitive On‐line Statistics (2001)Competitive On‐line StatisticsAdaptive Game Playing Using Multiplicative Weights (1999)Adaptive Game Playing Using M…Tracking the Best Expert (1998)Tracking the Best ExpertSequential prediction of individual sequences under general loss functions (1998)Sequential prediction of indi…A Game of Prediction with Expert Advice (1998)A Game of Prediction with Exp…Additive versus exponentiated gradient updates for linear prediction (1995)Additive versus exponentiated…An analog of the minimax theorem for vector payoffs (1956)Universal Portfolios (1991)How to use expert advice (1997)Online Convex Optimization in Dynamic Environments (2015)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)On Upper-Confidence Bound Policies for Switching Bandit Problems (2011)Online portfolio selection (2014)Gambling in a rigged casino: The adversarial multi-armed bandit problem (2002)Online convex programming and generalized infinitesimal gradient ascent (2003)Nearly Tight Bounds for the Continuum-Armed Bandit Problem (2004)Multi-armed bandits in metric spaces (2008)Linearly Parameterized Bandits (2010)Introduction to Stochastic Programming (2011)Contributions to the Theory of Games (1952)Theory of Games and Statistical Decisions. (1955)Contributions to the theory of games. (1960)A General Class of Adaptive Strategies (2001)Stochastic Approximations and Differential Inclusions (2005)Prediction, Learning, and Games (2006)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)The Pricing of Options and Corporate Liabilities (1973)An Online Convex Optimization Approach to Proactive Network Resource Allocation (2017)A Marketplace for Data (2019)Introduction to Multi-Armed Bandits (2019)Theory of games and economic behavior (2019)Using confidence bounds for exploitation-exploration trade-offs (2003)Improved Algorithms for Linear Stochastic Bandits (2011)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Mostly Exploration-Free Algorithms for Contextual Bandits (2020)Board engagement with digital technologies: A resource dependence framework (2021)From Reality to World. A Critical Perspective on AI Fairness (2022)Using and combining predictors that specialize (1997)Encyclopedia of Statistical Sciences (2004)Regret bounds for sleeping experts and bandits (2010)Potential-Based Algorithms in On-Line Prediction and Game Theory (2003)Online Learning: A Modern Introduction Using Convex Optimization (2019)Statistics of Robust Optimization: A Generalized Empirical Likelihood Approach (2021)
this work references cited by second hop

References

No references inside the corpus for this window.

Cited by

  • 2016Introduction to Online Convex Optimization814 cited
  • 2016Introduction to Online Convex Optimization805 cited
  • 2004Online convex optimization in the bandit setting: gradient descent without a gradient599 cited
  • 1998Tracking the Best Expert557 cited
  • 1999Adaptive Game Playing Using Multiplicative Weights516 cited
  • 2001Relative Loss Bounds for On-Line Density Estimation with the Exponential Family of Distributions297 cited
  • 2007Online Learning: Theory, Algorithms, and Applications297 cited
  • 1998A Game of Prediction with Expert Advice280 cited
  • 2019Online Decision Making with High-Dimensional Covariates264 cited
  • 2001Competitive On‐line Statistics226 cited
  • 1995Additive versus exponentiated gradient updates for linear prediction221 cited
  • 2008Competing in the dark: An efficient algorithm for bandit linear optimization182 cited
  • 2002Adaptive and self-confident on-line learning algorithms181 cited
  • 2008Efficient bandit algorithms for online multiclass prediction170 cited
  • 2007A primal-dual perspective of online learning algorithms

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

169 cited
  • 1998Sequential prediction of individual sequences under general loss functions160 cited