Kayal, A., Vakili, S., Toni, L., & Bernacchia, A. (2025). Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning.
Style de citation Chicago (17e éd.)Kayal, Aya, Sattar Vakili, Laura Toni, et Alberto Bernacchia. Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning. 2025.
Style de citation MLA (9e éd.)Kayal, Aya, et al. Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning. 2025.
Attention : ces citations peuvent ne pas être correctes à 100%.