Near-Optimal Sample Compl
Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning
Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning
arXiv:2502.07715v1 Announce Type: new
Abstract: Reinforcement Learning (RL) problems are being considered under increasingly more complex structures. While tabular and linear models have been thoroughly explored, the analytical study of RL under nonlinear function approximation, especially kernel-b…
