SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Bandit Theory meets Compressed Sensing for high dimensional Stochastic Linear Bandit
0 references·7 citing·24 second hop
Bandit Theory meets Compressed Sensing for high dimensional Stochastic Linear Bandit (2012)Bandit Theory meets Compressed Sensing fo…Doubly-Robust Lasso Bandit (2019)Doubly-Robust Lasso BanditContext Attentive Bandits: Contextual Bandit with Restricted Context (2017)Context Attentive Bandits: Co…Combinatorial semi-bandit with known covariance (2016)Combinatorial semi-bandit wit…Optimally Confident UCB: Improved Regret for Finite-Armed Bandits (2015)Optimally Confident UCB: Impr…Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits (2012)Online-to-Confidence-Set Conv…Joint Optimization and Variable Selection of High-dimensional Gaussian Processes (2012)Joint Optimization and Variab…Hierarchical Exploration for Accelerating Contextual Bandits (2012)Hierarchical Exploration for …A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning (2010)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Taking the Human Out of the Loop: A Review of Bayesian Optimization (2015)Bayesian Optimization in a Billion Dimensions via Random Embeddings (2016)Bayesian optimization techniques for high-dimensional simulation-based transportation problems (2022)Stochastic Linear Optimization Under Bandit Feedback (2008)An Empirical Evaluation of Thompson Sampling (2011)Improved Algorithms for Linear Stochastic Bandits (2011)Latent Contextual Bandits and their Application to Personalized Recommendations for New Users (2016)Some aspects of the sequential design of experiments (1952)Bandit Processes and Dynamic Allocation Indices (1979)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Anytime optimal algorithms in stochastic multi-armed bandits (2016)Bandit Algorithms (2020)Prediction, Learning, and Games (2006)Learning to Optimize via Posterior Sampling (2014)Introduction to Multi-Armed Bandits (2019)The Epoch-Greedy Algorithm for Multi-armed Bandits with Side Information (2007)Thompson Sampling for Contextual Bandits with Linear Payoffs (2012)Contextual Bandit with Adaptive Feature Extraction (2018)Incorporating Behavioral Constraints in Online AI Systems (2019)Optimal Exploitation of Clustering and History Information in Multi-armed Bandit (2019)Using confidence bounds for exploitation-exploration trade-offs (2003)Dynamic Batch Learning in High-Dimensional Sparse Linear Contextual Bandits (2023)
this work references cited by second hop

References

No references inside the corpus for this window.

Cited by

  • 2017Context Attentive Bandits: Contextual Bandit with Restricted Context64 cited
  • 2012Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits55 cited
  • 2012Joint Optimization and Variable Selection of High-dimensional Gaussian Processes54 cited
  • 2015Optimally Confident UCB: Improved Regret for Finite-Armed Bandits34 cited
  • 2012Hierarchical Exploration for Accelerating Contextual Bandits31 cited
  • 2019Doubly-Robust Lasso Bandit27 cited
  • 2016Combinatorial semi-bandit with known covariance26 cited

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