AI Paper Atlas

Research map / Reinforcement learning / Offline RL

Fat-to-Thin Policy Optimization: Offline Reinforcement Learning with Sparse Policies

Lingwei Zhu, Han Wang, Yukie Nagai

ICLR 2025 · Reinforcement learning › Offline RL · approach: Offline RL sample complexity theory

Read the paperCheck your idea against 137,217 papers

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes Fat-to-Thin Policy Optimization, an offline RL method that learns sparse continuous policies, which can assign strictly zero probability to some actions.

Problem

Offline reinforcement learning with continuous actions typically relies on Gaussian policies, which cannot represent sparse action distributions that place strictly zero probability on some actions, a property needed in safety-critical settings such as medicine.

Approach

Learns completely fat-free (sparse) continuous policies offline by combining sparse policy distributions with offline RL, moving from a dense ("fat") policy toward a sparse ("thin") one.

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy