SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Relative Expected Instantaneous Loss Bounds
6 references·0 citing·22 second hop
Relative Expected Instantaneous Loss Bounds (2002)Relative Expected Instantaneous Loss Boun…Relative Loss Bounds for On-Line Density Estimation with the Exponential Family of Distributions (2001)Relative Loss Bounds for On-L…Relative Loss Bounds for Multidimensional Regression Problems (2001)Relative Loss Bounds for Mult…Exponentiated Gradient versus Gradient Descent for Linear Predictors (1997)Exponentiated Gradient versus…Competitive On-line Linear Regression (1997)Competitive On-line Linear Re…Predicting a binary sequence almost as well as the optimal biased coin (1996)Predicting a binary sequence …Additive versus exponentiated gradient updates for linear prediction (1995)Additive versus exponentiated…An analog of the minimax theorem for vector payoffs (1956)How to use expert advice (1997)A primal-dual perspective of online learning algorithms (2007)Online Learning: Theory, Algorithms, and Applications (2007)Online Convex Optimization in Dynamic Environments (2015)Theory of Games and Statistical Decisions. (1955)Derandomizing Stochastic Prediction Strategies (1999)A Simple Adaptive Procedure Leading to Correlated Equilibrium (2000)Worst-case quadratic loss bounds for prediction using linear functions and gradient descent (1996)A Game of Prediction with Expert Advice (1998)Universal linear least squares prediction: upper and lower bounds (2002)Universal Switching Linear Least Squares Prediction (2007)Distributed Online Linear Regressions (2020)Regret bounds for prediction problems (1999)Potential-Based Algorithms in On-Line Prediction and Game Theory (2003)Introduction to Online Optimization (2011)Sequential prediction of individual sequences under general loss functions (1998)Adaptive and self-confident on-line learning algorithms (2002)Online Markov Decision Processes (2009)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)
this work references cited by second hop

References

  • 1997Exponentiated Gradient versus Gradient Descent for Linear Predictors856 cited
  • 2001Relative Loss Bounds for On-Line Density Estimation with the Exponential Family of Distributions297 cited
  • 1995Additive versus exponentiated gradient updates for linear prediction221 cited
  • 2001Relative Loss Bounds for Multidimensional Regression Problems135 cited
  • 1996Predicting a binary sequence almost as well as the optimal biased coin63 cited
  • 1997Competitive On-line Linear Regression59 cited

Cited by

No citing works inside the corpus for this window.

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