Co-occurring keywords · papers mentioning both
Papers
Exponential Bellman Equation and Improved Regret Bounds for Risk-Sensitive Reinforcement Learning
NeurIPS 2021
Fair Algorithms for Multi-Agent Multi-Armed Bandits
NeurIPS 2021
Fast Rate Learning in Stochastic First Price Bidding
ACML 2021
Fast Rates for the Regret of Offline Reinforcement Learning
COLT 2021
Federated Linear Contextual Bandits
NeurIPS 2021
Federated Multi-Armed Bandits
AAAI 2021
Federated Multi-armed Bandits with Personalization
AISTATS 2021
Finding the Stochastic Shortest Path with Low Regret: the Adversarial Cost and Unknown Transition Case
ICML 2021
Finite-Sample Regret Bound for Distributionally Robust Offline Tabular Reinforcement Learning
AISTATS 2021
Finite-time System Identification and Adaptive Control in Autoregressive Exogenous Systems
L4DC 2021
From Optimality to Robustness: Adaptive Re-Sampling Strategies in Stochastic Bandits
NeurIPS 2021
Fully Gap-Dependent Bounds for Multinomial Logit Bandit
AISTATS 2021
Generalized Linear Bandits with Local Differential Privacy
NeurIPS 2021
Heterogeneous Multi-player Multi-armed Bandits: Closing the Gap and Generalization
NeurIPS 2021
Hybrid Regret Bounds for Combinatorial Semi-Bandits and Adversarial Linear Bandits
NeurIPS 2021
Impact of Representation Learning in Linear Bandits
ICLR 2021
Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications
COLT 2021
Improved Analysis of the Tsallis-INF Algorithm in Stochastically Constrained Adversarial Bandits and Stochastic Bandits with Adversarial Corruptions
COLT 2021
Improved Corruption Robust Algorithms for Episodic Reinforcement Learning
ICML 2021
Improved Regret Bound and Experience Replay in Regularized Policy Iteration
ICML 2021
Improved Regret Bounds for Tracking Experts with Memory
NeurIPS 2021
Improved Regret Bounds of Bilinear Bandits using Action Space Analysis
ICML 2021
Improved Regret for Zeroth-Order Stochastic Convex Bandits
COLT 2021
Improved Variance-Aware Confidence Sets for Linear Bandits and Linear Mixture MDP
NeurIPS 2021
Improved Worst-Case Regret Bounds for Randomized Least-Squares Value Iteration
AAAI 2021