all InfoSec news
Exploration is Harder than Prediction: Cryptographically Separating Reinforcement Learning from Supervised Learning
April 8, 2024, 4:11 a.m. | Noah Golowich, Ankur Moitra, Dhruv Rohatgi
cs.CR 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 …
arxiv cryptographic cs.cc cs.cr cs.ds cs.lg easy exploration extension practice prediction work
More from arxiv.org / cs.CR updates on arXiv.org
Jobs in InfoSec / Cybersecurity
CyberSOC Technical Lead
@ Integrity360 | Sandyford, Dublin, Ireland
Cyber Security Strategy Consultant
@ Capco | New York City
Cyber Security Senior Consultant
@ Capco | Chicago, IL
Sr. Product Manager
@ MixMode | Remote, US
Corporate Intern - Information Security (Year Round)
@ Associated Bank | US WI Remote
Senior Offensive Security Engineer
@ CoStar Group | US-DC Washington, DC