Methods › Reinforcement Learning › Q-Learning Networks › DeepCubeAI

DeepCubeA + Imagination

DeepCubeAI

1 paper tagged archive 2025-07-28

Introduced by Forest Agostinelli et al. in Learning Discrete World Models for Heuristic Search

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

About DeepCubeAI

DeepCubeAI is an algorithm that learns a discrete world model and employs Deep Reinforcement Learning methods to learn a heuristic function that generalizes over start and goal states. We then integrate the learned model and the learned heuristic function with heuristic search, such as Q* search, to solve sequential decision making problems [paper] [Code] [PyPI] [Slides] [Poster]

‌

Key Contributions

DeepCubeAI is comprised of three key components:

  1. Discrete World Model
  2. Learns a world model that represents states in a discrete latent space.
  3. This approach tackles two challenges: model degradation and state re-identification.

    • Prediction errors less than 0.5 are corrected by rounding.
    • Re-identifies states by comparing two binary vectors.
  4. Generalizable Heuristic Function

  5. Utilizes Deep Q-Network (DQN) and hindsight experience replay (HER) to learn a heuristic function that generalizes over start and goal states.

  6. Optimized Search

  7. Integrates the learned model and the learned heuristic function with heuristic search to solve problems. It uses Q* search, a variant of A* search optimized for DQNs, which enables faster and more memory-efficient planning. ‌

Main Results

PaperSee Code · misaghsoltani/DeepCubeAI

Source in the archive: Learning Discrete World Models for Heuristic Search, a link on rlj.cs.umass.edu (archive link, not checked and not linked: not a paper host this site links to).

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 1 · with a code link: 1 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran: none of the 1 tagged papers has a Syntology run on record

Page 1 of 1: paper 1 of 1, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

8 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Deep Reinforcement Learning1
Heuristic Search1
Model-based Reinforcement Learning1
Reinforcement Learning1
Rubik's Cube1
Sequential Decision Making1
Sokoban1
Trajectory Planning1

Usage over time archive 2025-07-28

Papers per year tagged with DeepCubeAI: 2024 to 2024, peak 1 1 0 2024: 1 paper 2024
Papers per year the archive tags with this method, by the paper's archive date (1 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Q-Learning NetworksOffline Reinforcement Learning Methods

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections