SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Combinatorial Cascading Bandits
8 references·4 citing·26 second hop
Combinatorial Cascading Bandits (2015)Combinatorial Cascading BanditsCascading Bandits: Learning to Rank in the Cascade Model (2015)Cascading Bandits: Learning t…Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits (2014)Tight Regret Bounds for Stoch…Sequential Learning for Multi-Channel Wireless Network Monitoring With Channel Switching Costs (2014)Sequential Learning for Multi…Matroid Bandits: Fast Combinatorial Optimization with Learning (2014)Matroid Bandits: Fast Combina…Combinatorial multi-armed bandit: general framework, results and applications (2013)Combinatorial multi-armed ban…Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual Observations (2012)Combinatorial Network Optimiz…Analysis of Thompson Sampling for the multi-armed bandit problem (2011)Analysis of Thompson Sampling…Finite-time Analysis of the Multiarmed Bandit Problem (2002)Finite-time Analysis of the M…Thompson Sampling for Combinatorial Semi-Bandits (2018)Thompson Sampling for Combina…Thompson Sampling for Online Personalized Assortment Optimization Problems with Multinomial Logit Choice Models (2017)Thompson Sampling for Online …Online Learning to Rank in Stochastic Click Models (2017)Online Learning to Rank in St…DCM Bandits: Learning to Rank with Multiple Clicks (2016)DCM Bandits: Learning to Rank…Learning diverse rankings with multi-armed bandits (2008)Online Influence Maximization under Independent Cascade Model with Semi-Bandit Feedback (2016)Bernoulli Rank-1 Bandits for Click Feedback (2017)Minimal Exploration in Structured Stochastic Bandits (2017)Multi-Armed Bandit Allocation Indices. (1990)An Empirical Evaluation of Thompson Sampling (2011)Thompson Sampling for Contextual Bandits with Linear Payoffs (2012)Learning to Optimize via Posterior Sampling (2014)Introduction to Multi-Armed Bandits (2019)Some aspects of the sequential design of experiments (1952)Stochastic Linear Optimization Under Bandit Feedback (2008)Using confidence bounds for exploitation-exploration trade-offs (2003)Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms (2014)Decentralized Learning for Multiplayer Multiarmed Bandits (2014)The Nonstochastic Multiarmed Bandit Problem (2002)Cascading Bandits for Large-Scale Recommendation Problems (2016)Gambling in a rigged casino: The adversarial multi-armed bandit problem (2002)Multiproduct Dynamic Pricing with Limited Inventories Under a Cascade Click Model (2023)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Combinatorial Bandits Revisited (2015)Combinatorial Multi-Armed Bandit with General Reward Functions (2016)Prediction, Learning, and Games (2006)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players (2019)Stochastic Online Shortest Path Routing: The Value of Feedback (2017)Combinatorial Pure Exploration with Continuous and Separable Reward Functions and Its Applications (2018)
this work references cited by second hop

References

  • 2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
  • 2011Analysis of Thompson Sampling for the multi-armed bandit problem904 cited
  • 2012Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual Observations413 cited
  • 2015Cascading Bandits: Learning to Rank in the Cascade Model169 cited
  • 2014Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits155 cited
  • 2013Combinatorial multi-armed bandit: general framework, results and applications105 cited
  • 2014Sequential Learning for Multi-Channel Wireless Network Monitoring With Channel Switching Costs83 cited
  • 2014Matroid Bandits: Fast Combinatorial Optimization with Learning80 cited

Cited by

  • 2018Thompson Sampling for Combinatorial Semi-Bandits57 cited
  • 2017Online Learning to Rank in Stochastic Click Models56 cited
  • 2016DCM Bandits: Learning to Rank with Multiple Clicks52 cited
  • 2017Thompson Sampling for Online Personalized Assortment Optimization Problems with Multinomial Logit Choice Models44 cited

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