Co-occurring keywords · papers mentioning both
Papers
Neural Network Approximation for Pessimistic Offline Reinforcement Learning
AAAI 2024
Krylov–Bellman boosting: Super-linear policy evaluation in general state spaces
AISTATS 2023
Bellman Residual Orthogonalization for Offline Reinforcement Learning
NeurIPS 2022
Fast Rates for the Regret of Offline Reinforcement Learning
COLT 2021
Variance-Aware Off-Policy Evaluation with Linear Function Approximation
NeurIPS 2021
CAQL: Continuous Action Q-Learning
ICLR 2020
Is the Bellman residual a bad proxy?
NeurIPS 2017
Learning Nash Equilibrium for General-Sum Markov Games from Batch Data
AISTATS 2017
Difference of Convex Functions Programming for Reinforcement Learning
NeurIPS 2014
Policy Evaluation with Temporal Differences: A Survey and Comparison
JMLR 2014
Sparse Reinforcement Learning via Convex Optimization
ICML 2014
Robust Approximate Bilinear Programming for Value Function Approximation
JMLR 2011
Error Propagation for Approximate Policy and Value Iteration
NeurIPS 2010
Finite-sample Analysis of Bellman Residual Minimization
ACML 2010
Robust Value Function Approximation Using Bilinear Programming
NeurIPS 2009
Finite-Time Bounds for Fitted Value Iteration
JMLR 2008
Regularized Policy Iteration
NeurIPS 2008