all AI news
Pessimistic Causal Reinforcement Learning with Mediators for Confounded Offline Data
March 19, 2024, 4:43 a.m. | Danyang Wang, Chengchun Shi, Shikai Luo, Will Wei Sun
cs.LG updates on arXiv.org arxiv.org
Abstract: In real-world scenarios, datasets collected from randomized experiments are often constrained by size, due to limitations in time and budget. As a result, leveraging large observational datasets becomes a more attractive option for achieving high-quality policy learning. However, most existing offline reinforcement learning (RL) methods depend on two key assumptions--unconfoundedness and positivity--which frequently do not hold in observational data contexts. Recognizing these challenges, we propose a novel policy learning algorithm, PESsimistic CAusal Learning (PESCAL). We …
abstract arxiv budget causal cs.ai cs.lg data datasets however limitations offline policy quality reinforcement reinforcement learning stat.ml type world
More from arxiv.org / cs.LG updates on arXiv.org
Jobs in AI, ML, Big Data
Founding AI Engineer, Agents
@ Occam AI | New York
AI Engineer Intern, Agents
@ Occam AI | US
AI Research Scientist
@ Vara | Berlin, Germany and Remote
Data Architect
@ University of Texas at Austin | Austin, TX
Data ETL Engineer
@ University of Texas at Austin | Austin, TX
DevOps Engineer (Data Team)
@ Reward Gateway | Sofia/Plovdiv