regret analysis

Leveraging Observations in Bandits: Between Risks and Benefits AAAI 2019 Manipulating a Learning Defender and Ways to Counteract NeurIPS 2019 Online Learning via the Differential Privacy Lens NeurIPS 2019 A Smoothed Analysis of the Greedy Algorithm for the Linear Contextual Bandit Problem NeurIPS 2018 Learning with Abandonment ICML 2018 Boundary Crossing for General Exponential Families ALT 2017 Learning Infinite Layer Networks Without the Kernel Trick ICML 2017 Perishability of Data: Dynamic Pricing under Varying-Coefficient Models JMLR 2017 Contextual Combinatorial Cascading Bandits ICML 2016 Kernel Estimation and Model Combination in A Bandit Problem with Covariates JMLR 2016 Online PCA with Optimal Regret JMLR 2016 Cascading Bandits: Learning to Rank in the Cascade Model ICML 2015 Linear Multi-Resource Allocation with Semi-Bandit Feedback NeurIPS 2015 Online Ranking with Top-1 Feedback AISTATS 2015 Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays ICML 2015 Lipschitz Bandits: Regret Lower Bound and Optimal Algorithms COLT 2014 Online Clustering of Bandits ICML 2014 Hierarchical Regularization Cascade for Joint Learning ICML 2013 Online learning in episodic Markovian decision processes by relative entropy policy search NeurIPS 2013 Online Learning under Delayed Feedback ICML 2013 Hierarchical Optimistic Region Selection driven by Curiosity NeurIPS 2012 Committing Bandits NeurIPS 2011 Finite Time Analysis of Stratified Sampling for Monte Carlo NeurIPS 2011 Improved Algorithms for Linear Stochastic Bandits NeurIPS 2011 Learning Eigenvectors for Free NeurIPS 2011