conftrace_

regret bound

1926 papers

Explore in graph

Also known as

RB

Co-occurring keywords

online learning (1777) multi-armed bandit (1098) contextual bandit (381) stochastic optimization (1060) reinforcement learning (4352) online algorithm (445) upper confidence bound (197) markov decision process (790) thompson sampling (237) online convex optimization (165)

Papers

Nearly Optimal Algorithms with Sublinear Computational Complexity for Online Kernel Regression ICML 2023
Corruption-Robust Algorithms with Uncertainty Weighting for Nonlinear Contextual Bandits and Markov Decision Processes ICML 2023
A Distribution Optimization Framework for Confidence Bounds of Risk Measures ICML 2023
Langevin Thompson Sampling with Logarithmic Communication: Bandits and Reinforcement Learning ICML 2023
Horizon-Free and Variance-Dependent Reinforcement Learning for Latent Markov Decision Processes ICML 2023
Best of Both Worlds Policy Optimization ICML 2023
Generalized Implicit Follow-The-Regularized-Leader ICML 2023
Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path ICML 2023
Online Nonstochastic Control with Adversarial and Static Constraints ICML 2023
Nearly Minimax Optimal Reinforcement Learning for Linear Markov Decision Processes ICML 2023
Short-lived High-volume Bandits ICML 2023
Lower Bounds for Learning in Revealing POMDPs ICML 2023
Learning to Rank under Multinomial Logit Choice JMLR 2023
Refined Regret for Adversarial MDPs with Linear Function Approximation ICML 2023
Contextual Linear Bandits under Noisy Features: Towards Bayesian Oracles AISTATS 2023
Reinforcement Learning for Joint Optimization of Multiple Rewards JMLR 2023
A Framework for Adapting Offline Algorithms to Solve Combinatorial Multi-Armed Bandit Problems with Bandit Feedback ICML 2023
Robust and private stochastic linear bandits ICML 2023
Reinforcement Learning Can Be More Efficient with Multiple Rewards ICML 2023
Online Defense Strategies for Reinforcement Learning Against Adaptive Reward Poisoning AISTATS 2023
Interpolating Classifiers Make Few Mistakes JMLR 2023
Efficient Exploration via Epistemic-Risk-Seeking Policy Optimization ICML 2023
Last Switch Dependent Bandits with Monotone Payoff Functions ICML 2023
Optimal Algorithms for Latent Bandits with Cluster Structure AISTATS 2023
Exploration in Linear Bandits with Rich Action Sets and its Implications for Inference AISTATS 2023