← Back to papers
2025 AISTATS AISTATS 2025

Near-Optimal Sample Complexity in Reward-Free Kernel-based Reinforcement Learning

Authors

Aya Kayal , Sattar Vakili , Laura Toni , Alberto Bernacchia
Download PDF

Related papers

Relating Piecewise Linear Kolmogorov Arnold Networks to ReLU Networks 2025
Parallel Backpropagation for Inverse of a Convolution with Application to Normalizing Flows 2025
Adapting to Online Distribution Shifts in Deep Learning: A Black-Box Approach 2025
Planning and Learning in Risk-Aware Restless Multi-Arm Bandits 2025
HAVER: Instance-Dependent Error Bounds for Maximum Mean Estimation and Applications to Q-Learning and Monte Carlo Tree Search 2025