SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Cascading Bandits: Learning to Rank in the Cascade Model
5 references·8 citing·28 second hop
Cascading Bandits: Learning to Rank in the Cascade Model (2015)Cascading Bandits: Learning to Rank in th…Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms (2014)Combinatorial Multi-Armed Ban…Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual Observations (2012)Combinatorial Network Optimiz…Parametric Bandits: The Generalized Linear Case (2010)Parametric Bandits: The Gener…Learning diverse rankings with multi-armed bandits (2008)Learning diverse rankings wit…Finite-time Analysis of the Multiarmed Bandit Problem (2002)Finite-time Analysis of the M…Multiproduct Dynamic Pricing with Limited Inventories Under a Cascade Click Model (2023)Multiproduct Dynamic Pricing …Online Learning to Rank in Stochastic Click Models (2017)Online Learning to Rank in St…Minimal Exploration in Structured Stochastic Bandits (2017)Minimal Exploration in Struct…Bernoulli Rank-1 Bandits for Click Feedback (2017)Bernoulli Rank-1 Bandits for …Online Influence Maximization under Independent Cascade Model with Semi-Bandit Feedback (2016)Online Influence Maximization…DCM Bandits: Learning to Rank with Multiple Clicks (2016)DCM Bandits: Learning to Rank…Combinatorial Cascading Bandits (2015)Combinatorial Cascading Bandi…Efficient Learning in Large-Scale Combinatorial Semi-Bandits (2014)Efficient Learning in Large-S…The Nonstochastic Multiarmed Bandit Problem (2002)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)Using confidence bounds for exploitation-exploration trade-offs (2003)Stochastic Linear Optimization Under Bandit Feedback (2008)Decentralized Learning for Multiplayer Multiarmed Bandits (2014)Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits (2014)Prediction, Learning, and Games (2006)Optimistic bayesian sampling in contextual-bandit problems (2012)From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning (2014)Linear Thompson sampling revisited (2017)Bandit Problems, Sequential Allocation of Experiments. (1987)Combinatorial Multi-Armed Bandit with General Reward Functions (2016)Combinatorial Pure Exploration with Continuous and Separable Reward Functions and Its Applications (2018)UCB revisited: Improved regret bounds for the stochastic multi-armed bandit problem (2010)The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond (2011)Online Clustering of Bandits (2014)Improved Algorithm on Online Clustering of Bandits (2019)Gambling in a rigged casino: The adversarial multi-armed bandit problem (2002)Improved Algorithms for Linear Stochastic Bandits (2011)Some aspects of the sequential design of experiments (1952)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Pure Exploration with Multiple Correct Answers (2019)Multi-Armed Bandits With Correlated Arms (2021)Analysis of Thompson Sampling for the multi-armed bandit problem (2011)Thompson Sampling for Combinatorial Semi-Bandits (2018)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)
this work references cited by second hop

References

  • 2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
  • 2008Learning diverse rankings with multi-armed bandits504 cited
  • 2012Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual Observations413 cited
  • 2010Parametric Bandits: The Generalized Linear Case241 cited
  • 2014Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms196 cited

Cited by

  • 2017Minimal Exploration in Structured Stochastic Bandits113 cited
  • 2016Online Influence Maximization under Independent Cascade Model with Semi-Bandit Feedback74 cited
  • 2017Bernoulli Rank-1 Bandits for Click Feedback72 cited
  • 2015Combinatorial Cascading Bandits58 cited
  • 2017Online Learning to Rank in Stochastic Click Models56 cited
  • 2016DCM Bandits: Learning to Rank with Multiple Clicks52 cited
  • 2014Efficient Learning in Large-Scale Combinatorial Semi-Bandits48 cited
  • 2023Multiproduct Dynamic Pricing with Limited Inventories Under a Cascade Click Model20 cited

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