March 13, 2024, 4:43 a.m. | Raj Ghugare, Matthieu Geist, Glen Berseth, Benjamin Eysenbach

cs.LG updates on arXiv.org arxiv.org

arXiv:2401.11237v2 Announce Type: replace
Abstract: Some reinforcement learning (RL) algorithms can stitch pieces of experience to solve a task never seen before during training. This oft-sought property is one of the few ways in which RL methods based on dynamic-programming differ from RL methods based on supervised-learning (SL). Yet, certain RL methods based on off-the-shelf SL algorithms achieve excellent results without an explicit mechanism for stitching; it remains unclear whether those methods forgo this important stitching property. This paper studies …

abstract algorithms arxiv cs.lg dynamic dynamic-programming experience gap programming property reinforcement reinforcement learning solve supervised learning training type view

Senior Data Engineer

@ Displate | Warsaw

Junior Data Analyst - ESG Data

@ Institutional Shareholder Services | Mumbai

Intern Data Driven Development in Sensor Fusion for Autonomous Driving (f/m/x)

@ BMW Group | Munich, DE

Senior MLOps Engineer, Machine Learning Platform

@ GetYourGuide | Berlin

Data Engineer, Analytics

@ Meta | Menlo Park, CA

Data Engineer

@ Meta | Menlo Park, CA