Co-occurring keywords · papers mentioning both
Papers
Cost-Aware Near-Optimal Policy Learning
AAAI 2025
Randomized algorithms and PAC bounds for inverse reinforcement learning in continuous spaces
NeurIPS 2024
Rethinking Information-theoretic Generalization: Loss Entropy Induced PAC Bounds
ICLR 2024
Uniform Last-Iterate Guarantee for Bandits and Reinforcement Learning
NeurIPS 2024
Concentration analysis of multivariate elliptic diffusions
JMLR 2023
Measure the Predictive Heterogeneity
ICLR 2023
The Benefits of Being Distributional: Small-Loss Bounds for Reinforcement Learning
NeurIPS 2023
Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model
ALT 2021
Uniform-PAC Bounds for Reinforcement Learning with Linear Function Approximation
NeurIPS 2021
Sequential Transfer in Reinforcement Learning with a Generative Model
ICML 2020
Batch Policy Learning under Constraints
ICML 2019
Policy Certificates: Towards Accountable Reinforcement Learning
ICML 2019
Sample Efficient Policy Search for Optimal Stopping Domains
IJCAI 2017
Non-Asymptotic Analysis of Relational Learning with One Network
AISTATS 2014
Sample Complexity of Composite Likelihood
AISTATS 2012
Speedy Q-Learning
NeurIPS 2011