regret bound

Tracking the Best Expert in Non-stationary Stochastic Environments NeurIPS 2016 Volumetric Spanners: An Efficient Exploration Basis for Learning JMLR 2016 A Chaining Algorithm for Online Nonparametric Regression COLT 2015 Achieving All with No Parameters: AdaNormalHedge COLT 2015 Adaptive Online Learning NeurIPS 2015 Adaptive Stochastic Alternating Direction Method of Multipliers ICML 2015 Adaptive Strategy for Stratified Monte Carlo Sampling JMLR 2015 Algorithms with Logarithmic or Sublinear Regret for Constrained Contextual Bandits NeurIPS 2015 An Online Learning Algorithm for Bilinear Models ICML 2015 A Relative Exponential Weighing Algorithm for Adversarial Utility-based Dueling Bandits ICML 2015 Bandit Convex Optimization: \sqrtT Regret in One Dimension COLT 2015 Bandit Smooth Convex Optimization: Improving the Bias-Variance Tradeoff NeurIPS 2015 Bandits with Unobserved Confounders: A Causal Approach NeurIPS 2015 Batched Bandit Problems COLT 2015 Budgeted Bandit Problems with Continuous Random Costs ACML 2015 Cheap Bandits ICML 2015 Combinatorial Bandits Revisited NeurIPS 2015 Combinatorial Cascading Bandits NeurIPS 2015 Contextual Dueling Bandits COLT 2015 Copeland Dueling Bandits NeurIPS 2015 Cornering Stationary and Restless Mixing Bandits with Remix-UCB NeurIPS 2015 Efficient Learning in Large-Scale Combinatorial Semi-Bandits ICML 2015 Exp-Concavity of Proper Composite Losses COLT 2015 Explore no more: Improved high-probability regret bounds for non-stochastic bandits NeurIPS 2015 Fast Convergence of Regularized Learning in Games NeurIPS 2015