SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Partial Monitoring with Side Information
6 references·2 citing·27 second hop
Partial Monitoring with Side Information (2012)Partial Monitoring with Side InformationRegret Bounds for the Adaptive Control of Linear Quadratic Systems (2011)Regret Bounds for the Adaptiv…Improved Algorithms for Linear Stochastic Bandits (2011)Improved Algorithms for Linea…Efficient Optimal Learning for Contextual Bandits (2011)Efficient Optimal Learning fo…Parametric Bandits: The Generalized Linear Case (2010)Parametric Bandits: The Gener…Regret Minimization Under Partial Monitoring (2006)Regret Minimization Under Par…Using confidence bounds for exploitation-exploration trade-offs (2003)Using confidence bounds for e…DCM Bandits: Learning to Rank with Multiple Clicks (2016)DCM Bandits: Learning to Rank…On multilabel classification and ranking with bandit feedback (2014)On multilabel classification …The Theory of Learning in Games (1998)The Nonstochastic Multiarmed Bandit Problem (2002)Minimizing Regret With Label Efficient Prediction (2005)Prediction, Learning, and Games (2006)Partial Monitoring—Classification, Regret Bounds, and Algorithms (2014)Sequential Learning for Multi-Channel Wireless Network Monitoring With Channel Switching Costs (2014)Some aspects of the sequential design of experiments (1952)Introduction to Multi-Armed Bandits (2019)Bandit Algorithms (2020)Elicitation of Personal Probabilities and Expectations (1971)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Finite-time Analysis of the Multiarmed Bandit Problem (2002)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)Gambling in a rigged casino: The adversarial multi-armed bandit problem (2002)Learning diverse rankings with multi-armed bandits (2008)Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual Observations (2012)Near-optimal Regret Bounds for Reinforcement Learning (2010)Improved Regret Bounds for Thompson Sampling in Linear Quadratic Control Problems (2018)Improper Learning for Non-Stochastic Control (2020)Naive Exploration is Optimal for Online LQR (2020)Thompson Sampling for Contextual Bandits with Linear Payoffs (2012)Learning to Optimize via Posterior Sampling (2014)Optimistic bayesian sampling in contextual-bandit problems (2012)From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning (2014)Cascading Bandits: Learning to Rank in the Cascade Model (2015)
this work references cited by second hop

References

  • 2003Using confidence bounds for exploitation-exploration trade-offs1,189 cited
  • 2011Improved Algorithms for Linear Stochastic Bandits860 cited
  • 2010Parametric Bandits: The Generalized Linear Case241 cited
  • 2011Regret Bounds for the Adaptive Control of Linear Quadratic Systems213 cited
  • 2011Efficient Optimal Learning for Contextual Bandits174 cited
  • 2006Regret Minimization Under Partial Monitoring138 cited

Cited by

  • 2014On multilabel classification and ranking with bandit feedback60 cited
  • 2016DCM Bandits: Learning to Rank with Multiple Clicks52 cited

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