---
title: Latent Landmark Graphs Overview
url: https://www.emergentmind.com/topics/latent-landmark-graphs
type: topic
---

# Latent Landmark Graphs Overview

Latent landmark graphs are structured representations wherein nodes correspond to discrete or abstracted “landmarks” in an underlying space—typically a latent, high-dimensional, or combinatorial space—while edges capture reachability, ordering, or transition relationships that are crucial for efficient planning, learning, or representation. Originating as a bridge between sample-efficient learning and scalable symbolic planning, latent landmark graphs are now integral to state abstraction in reinforcement learning, robust manifold embedding, and generalized planning across problem instances and domains.

## 1. Formal Definitions and Structural Principles

A latent landmark graph comprises two core components: a set of landmark nodes and a collection of edges encoding probabilistic, geometric, or causal relationships.

- **Landmarks as Informative Subsets or Abstract Prototypes:** In continuous domains, such as model-based RL or graph embeddings, landmarks are typically points (or small regions) in a learned latent space that either maximize coverage (as in k-means++ or farthest point sampling) or capture statistically salient features [2011.12491, 2307.12063]. In planning, they correspond to parameterized predicate schemas that are critical for reaching goals [2509.17062].
- **Graph Structure:** Edges between landmarks encode diverse semantics: reachability costs or Q-values (in RL), weighted orderings or causal preconditions (planning), or spectral diffusion geometry (manifold learning).

**Probabilistic and lifted formulations** allow latent landmark graphs to generalize across problem instances by embodying domain-invariant structural knowledge rather than instance-specific facts [2509.17062]. Formal constructions frequently involve:

- Latent embedding functions $\phi : S \to \mathbb{R}^d$ or domain-to-graph mappings
- Edge weightings $w_{i,j}$ defined by Q-functions, transition models, or counting-based statistics
- Subgraph selection criteria, computationally driven by scalability and task demands

## 2. Construction Methodologies Across Domains

### a) Latent Manifold and Diffusion Embeddings

Neumann eigenmaps, as introduced by Sule & Czaja (2024), extend diffusion map embeddings with landmark subgraphs to yield efficient, stable representations [2502.06689]:

- Landmark subset $\delta S$ is sampled from data; residual subset $S$ defines the subgraph.
- The Neumann Laplacian $L_S^N = L_S^D - B_S^\top (T_S^\delta)^{-1} B_S$ incorporates boundary information, enabling a reflecting random walk interpretation.
- Eigenmap coordinates $\Psi_N(i) = (\phi_2(i), \ldots, \phi_{d+1}(i))$ recover diffusion distances via the spectral embedding of the subgraph, with extensions to held-out data via a Nyström-style out-of-sample condition.

### b) Model-Based Reinforcement Learning

In RL, latent landmark graphs encapsulate long-horizon exploration and planning by discretizing the latent space via subgoal prototypes [2011.12491, 2307.12063]:

- **Node Selection:** Greedy Latent Sparsification or Farthest Point Sampling create a set of landmarks $\mathcal{L}$ that maximize latent space coverage.
- **Edge Estimation:** Edges are weighted by learned reachability Q-functions $Q_{\rm reach}(z,\ell_j)$, reflecting expected discounted hitting times or utility between subgoals.
- **Graph-Based Planning:** Graph-search algorithms (Dijkstra, A*, soft-Floyd) over this structure enable global planning via intermediate subgoals, improving sample efficiency and long-horizon control robustness.

### c) Symbolic Planning and Problem Generalization

The probabilistic lifted ordering graph (p-LOG) framework generalizes landmark extraction across sets of planning tasks [2509.17062]:

- **Lifted Landmarks:** Nodes are parameterized schemas (e.g., $p(x_1,\ldots,x_k)$); edges encode probabilistic precedence relations $w(L'_i, L'_j)$ calibrated over multiple task instances.
- **Instantiating to New Tasks:** The two-phase procedure generates and aligns graphs from both initial state and goal state using variable-domain constraints and matching strategies. Probabilistic, reusable substructures yield high recall and precision when adapted to new tasks, setting a new baseline in generalized planning.

## 3. Learning, Optimization, and Algorithmic Frameworks

The learning of latent landmark graphs employs specialized objectives depending on the application domain:

### Reinforcement Learning

- **Contrastive Subgoal Representations:** Joint contrastive and regularization losses induce temporally coherent subgoal embeddings (as in HILL [2307.12063]), promoting both local continuity and global discriminability.
- **Dual Novelty–Utility Measures:** For exploration–exploitation balancing, novelty is computed from discounted latent occupancy; utility leverages UVFA-estimated values, enabling strategic subgoal selection along both axes.

### Manifold Learning

- **Spectral Decomposition:** Computational efficiency stems from restricting eigenproblems to landmark subgraphs, with resulting embeddings interpolated to the remainder via boundary-aware Nyström extension [2502.06689].
- **Reflecting Random Walks:** Both theoretical diffusion distances and empirical stability under dataset perturbation depend on the Neumann construction’s preservation of reflecting stochastic geometry.

### Generalized Planning

- **Probabilistic and Lifted Relational Induction:** Edges in p-LOG are weighted by empirical occurrence rates over collections of tasks, supporting scalable, probabilistically sound domain abstraction.

## 4. Empirical Advances and Performance Outcomes

Latent landmark graphs deliver measurable performance improvements across multiple domains:

| Task/Domain        | Metric                    | Latent Landmark Graphs | Baseline (Best Prior) |
|--------------------|--------------------------|------------------------|-----------------------|
| FetchPush (RL)     | Success Rate             | 78% [2011.12491]       | 33% (HER+SAC)         |
| AntMaze (RL)       | Success Rate             | 92% [2011.12491]       | 45% (HER+SAC)         |
| UCI Digits (Emb.)  | Clustering NMI           | 0.85  [2502.06689]     | 0.71 (Roseland)       |
| Barman (Planning)  | Landmark F1 (avg)        | 0.93 [2509.17062]      | 0.72 (True Baseline)  |
| Ant FourRooms (RL) | Sample Eff. & Asymptotic | HILL best [2307.12063] | HIRO/HESS (worse)     |

Latent landmark graphs in RL settings have demonstrated both faster convergence and higher asymptotic success rates. In symbolic planning, p-LOG and p-LGG representations deliver a significant increase in recall (>30 percentage points in some settings) with only minor losses in precision. NeuMaps in manifold learning preserve stability and clustering tightness even under substantial data pruning.

## 5. Integration with Planning, Learning, and Search Heuristics

Latent landmark graphs integrate flexibly into a wide range of AI pipelines:

- **Heuristic Extraction:** Probabilistic landmark orderings or counts yield powerful admissible heuristics for search (e.g., $h_{LM}$, LM-cut with probabilistic weights) [2509.17062].
- **Subgoal Planning and Curriculum:** RL agents exploit landmark-based decompositions for hierarchical planning, global search, or dynamic curriculum construction, often without recourse to direct model prediction [2011.12491, 2307.12063].
- **Diffusion Geometry and Out-of-Sample Extension:** NeuMaps support robust, out-of-sample manifold embeddings and enable diffusion-based distances that mirror reflective random walks [2502.06689].

## 6. Limitations, Open Challenges, and Future Directions

Despite their advantages, latent landmark graphs present critical open challenges:

- **Landmark Selection Tradeoffs:** The choice of landmark budget $N$ affects coverage, computation, and robustness. Poor embeddings or suboptimal coverage can yield misleading planning graphs [2011.12491].
- **Probabilistic Edge Semantics:** Uncertainty in edge weights (e.g., in p-LOG, $w<1$ edges) may produce false positives or negatives, affecting planning guarantees. Balancing precision and recall under uncertainty requires further study [2509.17062].
- **Scalability and High-Arity Domains:** Both symbolic and latent graphs can become complex in domains with large numbers of objects, predicates, or latent dimensions.
- **Extension to Continuous and Dynamic Graphs:** Extending landmark graphs from discrete to continuous settings, or enabling dynamic adaptation over long horizons, remains a nascent research area.
- **Theoretical Guarantees:** Rigorous analysis of planning optimality and error accumulation in RL settings with imperfect reachability or abstraction quality remains an open area [2011.12491, 2307.12063].

## 7. Cross-Domain Impact and Theoretical Significance

Latent landmark graphs constitute a unifying abstraction for multi-resolution reasoning across RL, symbolic planning, and geometric machine learning. Empirical gains in both sample efficiency and policy robustness, along with enhanced stability in high-dimensional representations, underscore their utility as foundational structures for scalable reasoning. The hybridization of probabilistic lifting (for generalization), spectral geometry (for efficiency and stability), and learned utility/novelty (for goal-driven exploration) positions latent landmark graphs as a versatile paradigm at the intersection of deep learning and automated planning [2502.06689, 2509.17062, 2011.12491, 2307.12063].

Source: https://www.emergentmind.com/topics/latent-landmark-graphs