Skip to content
conftrace_

regret bound

2,284 papers

RB

Papers

Posterior Sampling with Delayed Feedback for Reinforcement Learning with Linear Function Approximation NeurIPS 2023 Pricing against a Budget and ROI Constrained Buyer AISTATS 2023 Probably Anytime-Safe Stochastic Combinatorial Semi-Bandits ICML 2023 Projection-Free Online Convex Optimization via Efficient Newton Iterations NeurIPS 2023 Projection-free Online Exp-concave Optimization COLT 2023 Proper Losses, Moduli of Convexity, and Surrogate Regret Bounds COLT 2023 Provable Hierarchy-Based Meta-Reinforcement Learning AISTATS 2023 Provable Sim-to-real Transfer in Continuous Domain with Partial Observations ICLR 2023 Provably Efficient Generalized Lagrangian Policy Optimization for Safe Multi-Agent Reinforcement Learning L4DC 2023 Provably Efficient Model-Free Algorithms for Non-stationary CMDPs AISTATS 2023 Provably Efficient Model-free RL in Leader-Follower MDP with Linear Function Approximation L4DC 2023 Provably Efficient Reinforcement Learning via Surprise Bound AISTATS 2023 Provably efficient representation selection in Low-rank Markov Decision Processes: from online to offline RL UAI 2023 Provably Safe Reinforcement Learning with Step-wise Violation Constraints NeurIPS 2023 Quantum Bayesian Optimization NeurIPS 2023 Quantum Multi-Armed Bandits and Stochastic Linear Bandits Enjoy Logarithmic Regrets AAAI 2023 Randomized Gaussian Process Upper Confidence Bound with Tighter Bayesian Regret Bounds ICML 2023 Randomized Greedy Learning for Non-monotone Stochastic Submodular Maximization Under Full-bandit Feedback AISTATS 2023 Refined Regret for Adversarial MDPs with Linear Function Approximation ICML 2023 Regret Bounds for Markov Decision Processes with Recursive Optimized Certainty Equivalents ICML 2023 Regret Guarantees for Online Deep Control L4DC 2023 Reinforcement Learning Can Be More Efficient with Multiple Rewards ICML 2023 Reinforcement Learning for Joint Optimization of Multiple Rewards JMLR 2023 Reinforcement Learning with History Dependent Dynamic Contexts ICML 2023 Repeated Bilateral Trade Against a Smoothed Adversary COLT 2023