SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Distributed Online Learning in Social Recommender Systems
11 references·3 citing·36 second hop
Distributed Online Learning in Social Recommender Systems (2014)Distributed Online Learning in Social Rec…Online Learning of Rested and Restless Bandits (2012)Online Learning of Rested and…Non-Bayesian social learning (2012)Non-Bayesian social learningMulticlass classification with bandit feedback using adaptive regularization (2012)Multiclass classification wit…Learning in a Changing World: Restless Multiarmed Bandit With Unknown Dynamics (2012)Learning in a Changing World:…Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual Observations (2012)Combinatorial Network Optimiz…1 1 Online Learning of Rested and Restless Bandits (2012)1 1 Online Learning of Rested…Efficient Optimal Learning for Contextual Bandits (2011)Efficient Optimal Learning fo…Contextual Bandits with Linear Payoff Functions (2011)Contextual Bandits with Linea…Distributed Learning in Multi-Armed Bandit With Multiple Players (2010)Distributed Learning in Multi…The Epoch-Greedy algorithm for contextual multi-armed bandits (2007)The Epoch-Greedy algorithm fo…Finite-time Analysis of the Multiarmed Bandit Problem (2002)Finite-time Analysis of the M…Social Learning in Multi Agent Multi Armed Bandits (2019)Social Learning in Multi Agen…Multi-objective Contextual Multi-armed Bandit With a Dominant Objective (2018)Multi-objective Contextual Mu…Distributed Online Learning via Cooperative Contextual Bandits (2015)Distributed Online Learning v…The Nonstochastic Multiarmed Bandit Problem (2002)Stochastic Linear Optimization Under Bandit Feedback (2008)Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms (2011)Thompson Sampling for Contextual Bandits with Linear Payoffs (2012)Collaborative Filtering Bandits (2016)Some aspects of the sequential design of experiments (1952)Deterministic Sequencing of Exploration and Exploitation for Multi-Armed Bandit Problems (2013)On Regret-Optimal Learning in Decentralized Multiplayer Multiarmed Bandits (2016)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)Cascading Bandits: Learning to Rank in the Cascade Model (2015)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Finite-Time Analysis of Kernelised Contextual Bandits (2013)From Ads to Interventions: Contextual Bandits in Mobile Health (2017)Adaptive Treatment Assignment in Experiments for Policy Choice (2021)Sample mean based index policies byO(logn) regret for the multi-armed bandit problem (1995)Multi-Player Bandits -- a Musical Chairs Approach (2015)Bandit Processes and Dynamic Allocation Indices (1979)Channel Selection for Network-Assisted D2D Communication via No-Regret Bandit Learning With Calibrated Forecasting (2014)Multi-armed bandits with application to 5G small cells (2016)Innovation Diffusion As a Spatial Process (1967)Diffusion of innovations (1984)A Simple Model of Herd Behavior (1992)Monopoly Pricing in the Presence of Social Learning (2012)Social Learning and the Design of New Experience Goods (2017)A Theory of Non-Bayesian Social Learning (2018)Gambling in a rigged casino: The adversarial multi-armed bandit problem (2002)Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems (2006)Interactively optimizing information retrieval systems as a dueling bandits problem (2009)Contextual Gaussian Process Bandit Optimization (2011)Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits (2014)Prediction, Learning, and Games (2006)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Time-Varying Gaussian Process Bandit Optimization (2016)
this work references cited by second hop

References

  • 2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
  • 2011Contextual Bandits with Linear Payoff Functions599 cited
  • 2012Non-Bayesian social learning486 cited
  • 2012Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual Observations413 cited
  • 2010Distributed Learning in Multi-Armed Bandit With Multiple Players386 cited
  • 2007The Epoch-Greedy algorithm for contextual multi-armed bandits307 cited
  • 2011Efficient Optimal Learning for Contextual Bandits174 cited
  • 20121 1 Online Learning of Rested and Restless Bandits141 cited
  • 2012Learning in a Changing World: Restless Multiarmed Bandit With Unknown Dynamics139 cited
  • 2012Online Learning of Rested and Restless Bandits114 cited
  • 2012Multiclass classification with bandit feedback using adaptive regularization104 cited

Cited by

  • 2015Distributed Online Learning via Cooperative Contextual Bandits53 cited
  • 2019Social Learning in Multi Agent Multi Armed Bandits50 cited
  • 2018Multi-objective Contextual Multi-armed Bandit With a Dominant Objective35 cited

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