SZodixStudyAcademic Library
DashboardShelvesOpen accessMy libraryInboxNotesWriteLearnAlerts
More
Ask your libraryNotificationsQuick citeReview
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Discrete Prediction Games with Arbitrary Feedback and Loss
9 references·1 citing·33 second hop
Discrete Prediction Games with Arbitrary Feedback and Loss (2001)Discrete Prediction Games with Arbitrary …Gambling in a rigged casino: The adversarial multi-armed bandit problem (2002)Gambling in a rigged casino: …Competitive On‐line Statistics (2001)Competitive On‐line StatisticsAdaptive Game Playing Using Multiplicative Weights (1999)Adaptive Game Playing Using M…Sequential 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…How to use expert advice (1997)How to use expert adviceOn-line Prediction and Conversion Strategies (1996)On-line Prediction and Conver…Tight worst-case loss bounds for predicting with expert advice (1995)Tight worst-case loss bounds …How to use expert advice (1993)How to use expert advicePhased Exploration with Greedy Exploitation in Stochastic Combinatorial Partial Monitoring Games (2016)Phased Exploration with Greed…AGGREGATING STRATEGIES (1990)The Asymptotic Theory of Extreme Order Statistics (1990)Predicting a binary sequence almost as well as the optimal biased coin (1996)Competitive On-line Linear Regression (1997)Exponentiated Gradient versus Gradient Descent for Linear Predictors (1997)Derandomizing Stochastic Prediction Strategies (1999)Worst-case quadratic loss bounds for prediction using linear functions and gradient descent (1996)Contributions to the theory of games. (1960)Tracking the Best Expert (1998)Efficient algorithms for online decision problems (2004)Contributions to the Theory of Games (1952)Theory of Games and Statistical Decisions. (1955)A General Class of Adaptive Strategies (2001)Nearly Tight Bounds for the Continuum-Armed Bandit Problem (2004)Stochastic Approximations and Differential Inclusions (2005)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Potential-Based Algorithms in On-Line Prediction and Game Theory (2003)A primal-dual perspective of online learning algorithms (2007)Online Learning: A Modern Introduction Using Convex Optimization (2019)Some aspects of the sequential design of experiments (1952)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Combinatorial Multi-Armed Bandit: General Framework and Applications (2013)Multi-Armed Bandit Allocation Indices. (1990)Online convex optimization in the bandit setting: gradient descent without a gradient (2004)Multi-armed Bandit Algorithms and Empirical Evaluation (2005)Using and combining predictors that specialize (1997)Encyclopedia of Statistical Sciences (2004)Regret bounds for sleeping experts and bandits (2010)Derandomizing stochastic prediction strategies (1997)Minimizing Regret: The General Case (1999)Regret bounds for prediction problems (1999)Averaging Expert Predictions (1999)Tracking a Small Set of Experts by Mixing Past Posteriors (2001)
this work references cited by second hop

References

  • 2002Gambling in a rigged casino: The adversarial multi-armed bandit problem741 cited
  • 1997How to use expert advice631 cited
  • 1999Adaptive Game Playing Using Multiplicative Weights516 cited
  • 1998A Game of Prediction with Expert Advice280 cited
  • 2001Competitive On‐line Statistics226 cited
  • 1998Sequential prediction of individual sequences under general loss functions160 cited
  • 1993How to use expert advice129 cited
  • 1995Tight worst-case loss bounds for predicting with expert advice86 cited
  • 1996On-line Prediction and Conversion Strategies72 cited

Cited by

  • 2016Phased Exploration with Greedy Exploitation in Stochastic Combinatorial Partial Monitoring Games52 cited

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