SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Ranked bandits in metric spaces: learning diverse rankings over large document collections
16 references·4 citing·24 second hop
Ranked bandits in metric spaces: learning diverse rankings over large document collections (2013)Ranked bandits in metric spaces: learning…Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Regret Analysis of Stochastic…Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Information-Theoretic Regret …X -Armed Bandits (2011)X -Armed BanditsUnbiased offline evaluation of contextual-bandit-based news article recommendation algorithms (2011)Unbiased offline evaluation o…Contextual Bandits with Linear Payoff Functions (2011)Contextual Bandits with Linea…Regret bounds for sleeping experts and bandits (2010)Regret bounds for sleeping ex…Multi-armed bandits in metric spaces (2008)Multi-armed bandits in metric…Learning diverse rankings with multi-armed bandits (2008)Learning diverse rankings wit…The Epoch-Greedy algorithm for contextual multi-armed bandits (2007)The Epoch-Greedy algorithm fo…Prediction, Learning, and Games (2006)Prediction, Learning, and Gam…Online convex optimization in the bandit setting: gradient descent without a gradient (2004)Online convex optimization in…Nearly Tight Bounds for the Continuum-Armed Bandit Problem (2004)Nearly Tight Bounds for the C…Using confidence bounds for exploitation-exploration trade-offs (2003)Using confidence bounds for e…The Nonstochastic Multiarmed Bandit Problem (2002)The Nonstochastic Multiarmed …Finite-time Analysis of the Multiarmed Bandit Problem (2002)Finite-time Analysis of the M…The Continuum-Armed Bandit Problem (1995)The Continuum-Armed Bandit Pr…A Perspective on Incentive Design: Challenges and Opportunities (2018)A Perspective on Incentive De…Online Learning to Rank in Stochastic Click Models (2017)Online Learning to Rank in St…Multi-Objective Ranked Bandits for Recommender Systems (2017)Multi-Objective Ranked Bandit…DCM Bandits: Learning to Rank with Multiple Clicks (2016)DCM Bandits: Learning to Rank…Stochastic Linear Optimization Under Bandit Feedback (2008)Thompson Sampling for Contextual Bandits with Linear Payoffs (2012)Collaborative Filtering Bandits (2016)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Online Learning and Online Convex Optimization (2011)Online Learning and Online Convex Optimization (2012)Theory of games and economic behavior (2019)Exponentiated Gradient versus Gradient Descent for Linear Predictors (1997)Online convex programming and generalized infinitesimal gradient ascent (2003)Linearly Parameterized Bandits (2010)Introduction to Stochastic Programming (2011)A Stochastic Approximation Method (1951)Introduction to Online Convex Optimization (2016)Introduction to Online Convex Optimization (2016)Introduction to Multi-Armed Bandits (2019)Some aspects of the sequential design of experiments (1952)A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning (2010)Contextual Bandits with Similarity Information (2009)Interactively optimizing information retrieval systems as a dueling bandits problem (2009)Almost Optimal Exploration in Multi-Armed Bandits (2013)Improved Algorithms for Linear Stochastic Bandits (2011)Bandit Algorithms (2020)Optimistic bayesian sampling in contextual-bandit problems (2012)Batch learning from logged bandit feedback through counterfactual risk minimization (2015)
this work references cited by second hop

References

  • 2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
  • 2006Prediction, Learning, and Games3,176 cited
  • 2002The Nonstochastic Multiarmed Bandit Problem2,210 cited
  • 2012Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting2,098 cited
  • 2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems1,410 cited
  • 2003Using confidence bounds for exploitation-exploration trade-offs1,189 cited
  • 2011Contextual Bandits with Linear Payoff Functions599 cited
  • 2004Online convex optimization in the bandit setting: gradient descent without a gradient599 cited
  • 2008Learning diverse rankings with multi-armed bandits504 cited
  • 2011Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms448 cited
  • 2008Multi-armed bandits in metric spaces353 cited
  • 2007The Epoch-Greedy algorithm for contextual multi-armed bandits307 cited
  • 2004Nearly Tight Bounds for the Continuum-Armed Bandit Problem285 cited
  • 2011X -Armed Bandits205 cited
  • 1995The Continuum-Armed Bandit Problem201 cited
  • 2010

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

Regret bounds for sleeping experts and bandits
200 cited

Cited by

  • 2017Online Learning to Rank in Stochastic Click Models56 cited
  • 2016DCM Bandits: Learning to Rank with Multiple Clicks52 cited
  • 2017Multi-Objective Ranked Bandits for Recommender Systems41 cited
  • 2018A Perspective on Incentive Design: Challenges and Opportunities41 cited