regret bound

Online Multi-Armed Bandits with Adaptive Inference NeurIPS 2021 Online Non-Monotone DR-Submodular Maximization AAAI 2021 Online Optimization in Games via Control Theory: Connecting Regret, Passivity and Poincaré Recurrence ICML 2021 Online Policy Gradient for Model Free Learning of Linear Quadratic Regulators with $\sqrt$T Regret ICML 2021 Online Sparse Reinforcement Learning AISTATS 2021 On Lower Bounds for Standard and Robust Gaussian Process Bandit Optimization ICML 2021 On Optimal Robustness to Adversarial Corruption in Online Decision Problems NeurIPS 2021 On Reinforcement Learning with Adversarial Corruption and Its Application to Block MDP ICML 2021 On the Optimality of Batch Policy Optimization Algorithms ICML 2021 Optimal Algorithms for Stochastic Contextual Preference Bandits NeurIPS 2021 Optimal regret algorithm for Pseudo-1d Bandit Convex Optimization ICML 2021 Optimism in Reinforcement Learning with Generalized Linear Function Approximation ICLR 2021 Optimizing Conditional Value-At-Risk of Black-Box Functions NeurIPS 2021 Parallelizing Thompson Sampling NeurIPS 2021 Parameter-Free Multi-Armed Bandit Algorithms with Hybrid Data-Dependent Regret Bounds COLT 2021 Parametric Graph for Unimodal Ranking Bandit ICML 2021 Perturbation-based Regret Analysis of Predictive Control in Linear Time Varying Systems NeurIPS 2021 Policy Optimization in Adversarial MDPs: Improved Exploration via Dilated Bonuses NeurIPS 2021 Power of Hints for Online Learning with Movement Costs AISTATS 2021 Prediction against a limited adversary JMLR 2021 Prior-independent Dynamic Auctions for a Value-maximizing Buyer NeurIPS 2021 Private Adaptive Gradient Methods for Convex Optimization ICML 2021 Problem-Complexity Adaptive Model Selection for Stochastic Linear Bandits AISTATS 2021 Projection-free Decentralized Online Learning for Submodular Maximization over Time-Varying Networks JMLR 2021 Projection-free Online Learning over Strongly Convex Sets AAAI 2021