SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Worst-case quadratic loss bounds for prediction using linear functions and gradient descent
2 references·10 citing·35 second hop
Worst-case quadratic loss bounds for prediction using linear functions and gradient descent (1996)Worst-case quadratic loss bounds for pred…Exponentiated Gradient versus Gradient Descent for Linear Predictors (1997)Exponentiated Gradient versus…AGGREGATING STRATEGIES (1990)AGGREGATING STRATEGIESRegret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization (2022)Regret and Cumulative Constra…Distributed Online Linear Regressions (2020)Distributed Online Linear Reg…Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints (2020)Distributed Bandit Online Con…Online Convex Optimization with Stochastic Constraints (2017)Online Convex Optimization wi…Universal Piecewise Linear Prediction Via Context Trees (2007)Universal Piecewise Linear Pr…Reinforcement Learning with Immediate Rewards and Linear Hypotheses (2003)Reinforcement Learning with I…Relative Loss Bounds for Multidimensional Regression Problems (2001)Relative Loss Bounds for Mult…Analysis of Two Gradient-Based Algorithms for On-Line Regression (1999)Analysis of Two Gradient-Base…Competitive On-line Linear Regression (1997)Competitive On-line Linear Re…On-line Prediction and Conversion Strategies (1996)On-line Prediction and Conver…Additive versus exponentiated gradient updates for linear prediction (1995)Regret bounds for prediction problems (1999)Relative Loss Bounds for On-Line Density Estimation with the Exponential Family of Distributions (2001)Potential-Based Algorithms in On-Line Prediction and Game Theory (2003)Introduction to Online Optimization (2011)How to use expert advice (1993)Derandomizing Stochastic Prediction Strategies (1999)Discrete Prediction Games with Arbitrary Feedback and Loss (2001)How to use expert advice (1997)A Game of Prediction with Expert Advice (1998)A simple randomized algorithm for sequential prediction of ergodic time series (1999)A continuous-time approach to online optimization (2017)Gambling in a rigged casino: The adversarial multi-armed bandit problem (2002)The Nonstochastic Multiarmed Bandit Problem (2002)Using confidence bounds for exploitation-exploration trade-offs (2003)Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oracles (2020)Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability (2021)Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits (2023)Tight worst-case loss bounds for predicting with expert advice (1995)Relative Expected Instantaneous Loss Bounds (2002)Universal linear least squares prediction: upper and lower bounds (2002)Universal schemes for sequential decision from individual data sequences (1993)A Monte Carlo study of the forecasting performance of empirical SETAR models (1999)Universal Switching Linear Least Squares Prediction (2007)Online convex programming and generalized infinitesimal gradient ascent (2003)Online Learning and Online Convex Optimization (2011)Constrained Online Convex Optimization With Feedback Delays (2020)Online Learning and Online Convex Optimization (2012)Theory of Games and Statistical Decisions (1955)Regret bounds for sleeping experts and bandits (2010)Evolutionary Game Theory: A Renaissance (2018)Learning in games with continuous action sets and unknown payoff functions (2018)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
  • 1990AGGREGATING STRATEGIES326 cited

Cited by

  • 2001Relative Loss Bounds for Multidimensional Regression Problems135 cited
  • 2017Online Convex Optimization with Stochastic Constraints130 cited
  • 2020Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints113 cited
  • 2007Universal Piecewise Linear Prediction Via Context Trees91 cited
  • 2003Reinforcement Learning with Immediate Rewards and Linear Hypotheses83 cited
  • 1996On-line Prediction and Conversion Strategies72 cited
  • 1999Analysis of Two Gradient-Based Algorithms for On-Line Regression69 cited
  • 1997Competitive On-line Linear Regression59 cited
  • 2020Distributed Online Linear Regressions46 cited
  • 2022Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization45 cited

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