regret bound

Partner-Aware Algorithms in Decentralized Cooperative Bandit Teams AAAI 2022 PDE-Based Optimal Strategy for Unconstrained Online Learning ICML 2022 Policy Optimization for Stochastic Shortest Path COLT 2022 PopArt: Efficient Sparse Regression and Experimental Design for Optimal Sparse Linear Bandits NeurIPS 2022 Privacy Amplification via Shuffling for Linear Contextual Bandits ALT 2022 Procrastinated Tree Search: Black-Box Optimization with Delayed, Noisy, and Multi-Fidelity Feedback AAAI 2022 Product Ranking for Revenue Maximization with Multiple Purchases NeurIPS 2022 Projection-free Distributed Online Learning with Sublinear Communication Complexity JMLR 2022 Provably Efficient Model-Free Constrained RL with Linear Function Approximation NeurIPS 2022 Pushing the Efficiency-Regret Pareto Frontier for Online Learning of Portfolios and Quantum States COLT 2022 Queue Up Your Regrets: Achieving the Dynamic Capacity Region of Multiplayer Bandits NeurIPS 2022 Rate-Optimal Online Convex Optimization in Adaptive Linear Control NeurIPS 2022 Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization AISTATS 2022 Regret Bounds for Information-Directed Reinforcement Learning NeurIPS 2022 Regret Bounds for Multilabel Classification in Sparse Label Regimes NeurIPS 2022 Regret Bounds for Risk-Sensitive Reinforcement Learning NeurIPS 2022 Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation ICML 2022 Regret, stability & fairness in matching markets with bandit learners AISTATS 2022 Reinforcement Learning Augmented Asymptotically Optimal Index Policy for Finite-Horizon Restless Bandits AAAI 2022 Reinforcement Learning in a Birth and Death Process: Breaking the Dependence on the State Space NeurIPS 2022 Reinforcement Learning with a Terminator NeurIPS 2022 Reinforcement Learning with Fast Stabilization in Linear Dynamical Systems AISTATS 2022 Residual bootstrap exploration for stochastic linear bandit UAI 2022 Revisiting Online Submodular Minimization: Gap-Dependent Regret Bounds, Best of Both Worlds and Adversarial Robustness ICML 2022 Robust Imitation via Mirror Descent Inverse Reinforcement Learning NeurIPS 2022