regret bound

A Bandit Model for Human-Machine Decision Making with Private Information and Opacity AISTATS 2022 A Best-of-Both-Worlds Algorithm for Bandits with Delayed Feedback NeurIPS 2022 ActiveHedge: Hedge meets Active Learning ICML 2022 Adaptive Bandit Convex Optimization with Heterogeneous Curvature COLT 2022 Adaptive Best-of-Both-Worlds Algorithm for Heavy-Tailed Multi-Armed Bandits ICML 2022 Adaptively Exploiting d-Separators with Causal Bandits NeurIPS 2022 Adversarially Robust Multi-Armed Bandit Algorithm with Variance-Dependent Regret Bounds COLT 2022 A Last Switch Dependent Analysis of Satiation and Seasonality in Bandits AISTATS 2022 Almost Optimal Algorithms for Two-player Zero-Sum Linear Mixture Markov Games ALT 2022 Alternating Mirror Descent for Constrained Min-Max Games NeurIPS 2022 A Lyapunov-Based Methodology for Constrained Optimization with Bandit Feedback AAAI 2022 A Model Selection Approach for Corruption Robust Reinforcement Learning ALT 2022 An α-No-Regret Algorithm For Graphical Bilinear Bandits NeurIPS 2022 An Analysis of Ensemble Sampling NeurIPS 2022 An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem NeurIPS 2022 A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs NeurIPS 2022 An explore-then-commit algorithm for submodular maximization under full-bandit feedback UAI 2022 An Information-Theoretic Framework for Deep Learning NeurIPS 2022 Anonymous Bandits for Multi-User Systems NeurIPS 2022 Anti-Concentrated Confidence Bonuses For Scalable Exploration ICLR 2022 Anytime Guarantees under Heavy-Tailed Data AAAI 2022 Approximate Top-m Arm Identification with Heterogeneous Reward Variances AISTATS 2022 A Reduction from Linear Contextual Bandits Lower Bounds to Estimations Lower Bounds ICML 2022 A Regret-Variance Trade-Off in Online Learning NeurIPS 2022 A Robust Phased Elimination Algorithm for Corruption-Tolerant Gaussian Process Bandits NeurIPS 2022