atlas

Research map / Reinforcement learning / Visual and representation RL

Hierarchical Programmatic Option Framework

NeurIPS 2024 · Reinforcement learning › Visual and representation RL · approach: Scalable RL systems and environments · 1 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

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

Proposes HIPO, a hierarchical framework that retrieves diverse, compatible, effective programs (via modified CEM in a learned program embedding space) as options and trains a PPO high-level policy to sequence them for long-horizon Karel tasks.

Problem

Programmatic RL policies are human-readable but only handle short-horizon tasks and fail to generalize to longer horizons; long repetitive tasks need reusable skills.

Approach

Retrieve a set of effective, diverse, and compatible programs as options by extending the Cross-Entropy Method in a learned program embedding space with a diversity multiplier and a compatibility-aware sequence return, then learn a high-level PPO policy that selects which program to execute next.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Add diversity and compatibility to program option retrieval (ablation)CEM option retrieval for HIPO · KAREL-LONG tasksmean returnHelped
Add compatibility to diversity-based option retrieval (ablation)HIPO · SEESAWmean return: 0.28 ± 0.23 -> 0.53 ± 0.10Helped
Add compatibility to diversity-based option retrieval (ablation)HIPO · INF-DOORKEYmean return: 0.36 ± 0.26 -> 0.66± 0.07Helped
Add the diversity multiplier to CEM program search (ablation)CEM · KAREL and KAREL-HARD tasksmean returnHelped
Learn a high-level policy instead of choosing options randomly (ablation)HIPO · KAREL-LONG tasksmean returnHelped
Replace programmatic options with primitive actions (ablation)HIPO high-level policy · KAREL-LONG tasksmean returnHurt

Surprising findings

Limitations

Experimental setup

Datasets: KAREL problem set KAREL-HARD problem set KAREL-LONG problem set (new) randomly sampled Karel DSL programs

Benchmarks: KAREL KAREL-HARD KAREL-LONG

Metrics: mean return standard deviation over seeds program sample efficiency performance drop under extended horizon

Baselines: CEM LEAPS HPRL DRL (PPO) Option-Critic PAO HC (hill climbing) Random Transition

Builds on: LEAPS Option-Critic HPRL Cross-Entropy Method PPO

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