all AI news
Exploration is Harder than Prediction: Cryptographically Separating Reinforcement Learning from Supervised Learning
April 8, 2024, 4:42 a.m. | Noah Golowich, Ankur Moitra, Dhruv Rohatgi
cs.LG updates on arXiv.org arxiv.org
Abstract: Supervised learning is often computationally easy in practice. But to what extent does this mean that other modes of learning, such as reinforcement learning (RL), ought to be computationally easy by extension? In this work we show the first cryptographic separation between RL and supervised learning, by exhibiting a class of block MDPs and associated decoding functions where reward-free exploration is provably computationally harder than the associated regression problem. We also show that there is …
abstract arxiv cs.cc cs.cr cs.ds cs.lg easy exploration extension mean practice prediction reinforcement reinforcement learning show supervised learning type work
More from arxiv.org / cs.LG updates on arXiv.org
Jobs in AI, ML, Big Data
Software Engineer for AI Training Data (School Specific)
@ G2i Inc | Remote
Software Engineer for AI Training Data (Python)
@ G2i Inc | Remote
Software Engineer for AI Training Data (Tier 2)
@ G2i Inc | Remote
Data Engineer
@ Lemon.io | Remote: Europe, LATAM, Canada, UK, Asia, Oceania
Artificial Intelligence – Bioinformatic Expert
@ University of Texas Medical Branch | Galveston, TX
Lead Developer (AI)
@ Cere Network | San Francisco, US