SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms
12 references·8 citing·34 second hop
Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms (2014)Combinatorial Multi-Armed Bandit and Its …Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual Observations (2012)Combinatorial Network Optimiz…The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond (2011)The KL-UCB Algorithm for Boun…Multi-armed bandits in metric spaces (2008)Multi-armed bandits in metric…Learning diverse rankings with multi-armed bandits (2008)Learning diverse rankings wit…Dynamic Assortment with Demand Learning for Seasonal Consumer Goods (2007)Dynamic Assortment with Deman…Nearly Tight Bounds for the Continuum-Armed Bandit Problem (2004)Nearly Tight Bounds for the C…Minimax policies for adversarial and stochastic bandits (2004)Minimax policies for adversar…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…Bandit Problems, Sequential Allocation of Experiments. (1987)Bandit Problems, Sequential A…Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards (1987)Asymptotically efficient allo…Thompson Sampling for Combinatorial Semi-Bandits (2018)Thompson Sampling for Combina…Combinatorial Pure Exploration with Continuous and Separable Reward Functions and Its Applications (2018)Combinatorial Pure Exploratio…A Combinatorial-Bandit Algorithm for the Online Joint Bid/Budget Optimization of Pay-per-Click Advertising Campaigns (2018)A Combinatorial-Bandit Algori…Thompson Sampling for Online Personalized Assortment Optimization Problems with Multinomial Logit Choice Models (2017)Thompson Sampling for Online …Feedback-Aware Social Event-Participant Arrangement (2017)Feedback-Aware Social Event-P…Online Influence Maximization under Independent Cascade Model with Semi-Bandit Feedback (2016)Online Influence Maximization…Combinatorial Multi-Armed Bandit with General Reward Functions (2016)Combinatorial Multi-Armed Ban…Cascading Bandits: Learning to Rank in the Cascade Model (2015)Cascading Bandits: Learning t…Bandit Processes and Dynamic Allocation Indices (1979)Exploration–exploitation tradeoff using variance estimates in multi-armed bandits (2009)Optimistic bayesian sampling in contextual-bandit problems (2012)Bandits With Heavy Tail (2013)KULLBACK-LEIBLER UPPER CONFIDENCE BOUNDS FOR OPTIMAL SEQUENTIAL ALLOCATION (2013)Prediction, Learning, and Games (2006)UCB revisited: Improved regret bounds for the stochastic multi-armed bandit problem (2010)Combinatorial bandits (2012)Further Optimal Regret Bounds for Thompson Sampling (2012)Some aspects of the sequential design of experiments (1952)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)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)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)Discrete Choice Analysis (1985)Restless bandits: activity allocation in a changing world (1988)Dynamic Pricing for Nonperishable Products with Demand Learning (2009)Why is Assortment Planning so Difficult for Retailers? A Framework and Research Agenda (2009)Introduction to Multi-Armed Bandits (2019)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)Learning by Doing and the Choice of Technology (1996)Linearly Parameterized Bandits (2010)Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms (2011)Indexability of Restless Bandit Problems and Optimality of Whittle Index for Dynamic Multichannel Access (2010)Parallelizing Exploration-Exploitation Tradeoffs with Gaussian Process Bandit Optimization (2012)Safe Exploration for Optimization with Gaussian Processes (2015)Multi-Armed Bandit Problems (2007)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
  • 2002The Nonstochastic Multiarmed Bandit Problem2,210 cited
  • 1987Bandit Problems, Sequential Allocation of Experiments.566 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
  • 2011The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond363 cited
  • 1987Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards358 cited
  • 2008Multi-armed bandits in metric spaces353 cited
  • 2004Minimax policies for adversarial and stochastic bandits330 cited
  • 2007Dynamic Assortment with Demand Learning for Seasonal Consumer Goods307 cited
  • 2004Nearly Tight Bounds for the Continuum-Armed Bandit Problem285 cited
  • 1995The Continuum-Armed Bandit Problem201 cited

Cited by

  • 2015Cascading Bandits: Learning to Rank in the Cascade Model169 cited
  • 2016Combinatorial Multi-Armed Bandit with General Reward Functions85 cited
  • 2016Online Influence Maximization under Independent Cascade Model with Semi-Bandit Feedback

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

74 cited
  • 2018Combinatorial Pure Exploration with Continuous and Separable Reward Functions and Its Applications60 cited
  • 2018Thompson Sampling for Combinatorial Semi-Bandits57 cited
  • 2018A Combinatorial-Bandit Algorithm for the Online Joint Bid/Budget Optimization of Pay-per-Click Advertising Campaigns45 cited
  • 2017Thompson Sampling for Online Personalized Assortment Optimization Problems with Multinomial Logit Choice Models44 cited
  • 2017Feedback-Aware Social Event-Participant Arrangement40 cited