Pith. sign in

REVIEW 3 cited by

Hierarchical Reinforcement Learning By Discovering Intrinsic Options

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2101.06521 v3 pith:DYRU4A6N submitted 2021-01-16 cs.LG

Hierarchical Reinforcement Learning By Discovering Intrinsic Options

classification cs.LG
keywords hierarchicallearningoptionshidiotasksintrinsiclearnedlower-level
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

We propose a hierarchical reinforcement learning method, HIDIO, that can learn task-agnostic options in a self-supervised manner while jointly learning to utilize them to solve sparse-reward tasks. Unlike current hierarchical RL approaches that tend to formulate goal-reaching low-level tasks or pre-define ad hoc lower-level policies, HIDIO encourages lower-level option learning that is independent of the task at hand, requiring few assumptions or little knowledge about the task structure. These options are learned through an intrinsic entropy minimization objective conditioned on the option sub-trajectories. The learned options are diverse and task-agnostic. In experiments on sparse-reward robotic manipulation and navigation tasks, HIDIO achieves higher success rates with greater sample efficiency than regular RL baselines and two state-of-the-art hierarchical RL methods.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Robust Instruction Compliance in Cooperative Multi-Agent Reinforcement Learning

    cs.AI 2026-05 unverdicted novelty 6.0

    MAVIC corrects Bellman backups at instruction boundaries by adjusting the incoming objective and restoring continuation value, enabling consistent estimation under stochastic instruction switching in a unified policy.

  2. Robust Instruction Compliance in Cooperative Multi-Agent Reinforcement Learning

    cs.AI 2026-05 unverdicted novelty 6.0

    MAVIC corrects Bellman backups at instruction boundaries by adjusting the incoming objective and restoring continuation value, enabling consistent estimation under stochastic instruction switching in cooperative MARL.

  3. Vision-Based Obstacle Separation for Strawberry Harvesting in Clusters Using Hierarchical Reinforcement Learning

    cs.RO 2026-07 conditional novelty 4.0

    A hierarchical reinforcement-learning harvester that separates obstacle strawberries before grasping improves real-world strawberry-picking success from 59.7% to 80.0% versus direct picking, at a cost of 1.22 s extra ...