Predictive Representation Learning (PRL)

• Predictive Representation Learning is a self-supervised method that trains latent representations by predicting unobserved or future components of data.
• It leverages causal and structural context—including sequential, spatial, and relational cues—to build dynamics-aware embeddings applicable in reinforcement learning, language modeling, and autonomous driving.
• PRL systems integrate anti-collapse strategies like feature decorrelation and decoder anchoring to balance information preservation with predictive fidelity.

Searching arXiv for recent and foundational papers on Predictive Representation Learning. Predictive Representation Learning (PRL) denotes a family of methods in which a representation is judged by how well it supports prediction of related but not directly observed structure in the data, typically across time, space, or relational context. In the broadest formulation provided in recent self-supervised literature, PRL “encompasses self-supervised methods that define learning objectives in latent space through prediction of unobserved representations” (Dutta et al., 15 Apr 2026). Across domains, this predictive principle appears in latent interpolation for masked sequential states, causal next-state prediction in reinforcement learning, general value function–based predictive state construction, and future-conditioned sequence modeling (Koller et al., 10 Jun 2026, Lee et al., 2023, Graves et al., 2020, Lan et al., 2021). The common thread is that the learned state is not optimized merely for invariance or reconstruction, but for encoding structure that makes other parts of the process predictable.

1. Definition and conceptual scope

Predictive Representation Learning is explicitly defined, in a recent taxonomy of self-supervised learning, as a distinct category that “revolves around latent prediction of unobserved components of data based on the observation” (Dutta et al., 15 Apr 2026). In that formulation, an unlabeled sample $x$ is partitioned into observed context $c(x)$ and unobserved target $t(x)$, a context encoder maps $c(x)$ to a latent vector, a target encoder maps $t(x)$ to another latent vector, and a predictor minimizes a latent-space discrepancy: $\mathcal{L}_{\text{PRL} = \mathbb{E}_{x \sim \mathcal{D} \left[ \left\| g_{\phi}\big(f_{\theta}(c(x))\big) - \mathrm{sg}\big(f_{\bar{\theta}(t(x))\big) \right\|_2^2 \right].$ This distinguishes PRL from alignment-based methods, which match two observed views, and from reconstruction-based methods, which restore masked input in input space (Dutta et al., 15 Apr 2026).

A more operational definition appears in sequential settings: “a good latent representation of data should make it easy to predict other, related parts of the data—typically in time, space, or some abstract relational structure” (Koller et al., 10 Jun 2026). In reinforcement learning, this becomes the principle that good representations should be “temporally predictive,” encoding enough information to predict how the environment will evolve (Lee et al., 2023). In autonomous driving, predictive representations are directly instantiated as vectors of general value function outputs predicting future lane centeredness and road angle under a fixed policy (Graves et al., 2020). In language modeling, PRL is described as explicitly constraining recurrent states to encode predictions such as POS or NER labels for the next word, rather than relying on those properties to emerge only implicitly (Lan et al., 2021).

This suggests a unifying interpretation: PRL is less a single architecture than an organizing principle. A plausible implication is that the central design choice is not whether a model uses transformers, convolutions, or recurrent networks, but what future-, context-, or structure-conditioned quantity the latent state is required to predict.

2. Relationship to alignment, reconstruction, and predictive coding

The recent SSL taxonomy places PRL alongside alignment-based and reconstruction-based learning as a third family (Dutta et al., 15 Apr 2026). Alignment-based methods optimize invariance between views in latent space; reconstruction-based methods optimize fidelity in input space; PRL optimizes directional prediction from observed context to unobserved target in latent space (Dutta et al., 15 Apr 2026). The taxonomy further characterizes PRL as operating in latent space only, with a directional objective, and emphasizes “structural dependencies” and “world-model capability” as its representational focus (Dutta et al., 15 Apr 2026).

This distinction is visible in concrete architectures. RePAIR, introduced for chess, synthesizes MAE, BERT-style masked modeling, and JEPA-style latent prediction in a single encoder–predictor–decoder system (Koller et al., 10 Jun 2026). It masks large portions of a sequence of latent states, predicts the missing latent states from surrounding context by iterative refinement, and then decodes repaired latents back into board states (Koller et al., 10 Jun 2026). In this sense, RePAIR is MAE-like in its masking, BERT-like in its bidirectional contextual reasoning, and JEPA-like in predicting latent vectors rather than discrete tokens or raw pixels (Koller et al., 10 Jun 2026). The paper states that RePAIR can be viewed as “JEPA in latent space, anchored by an autoencoding decoder” (Koller et al., 10 Jun 2026).

A different contrast appears in reinforcement learning. SimTPR frames PRL as causal next-state prediction in latent space, closer to world models and predictive state representations than to masked, non-causal sequence modeling (Lee et al., 2023). The authors explicitly compare a causal transformer to a non-causal masked transformer and report that the causal transformer attains IQM $0.451$, while non-causal variants reach IQM $0.270$ and $0.385$, despite high feature rank in some masked settings (Lee et al., 2023). Their interpretation is that reconstructing masked states using future context is a weaker inductive bias for control than strict forward prediction (Lee et al., 2023).

Contrastive predictive coding provides yet another branch. Relative Predictive Coding (RPC) preserves the predictive pairing structure of CPC but replaces InfoNCE’s log-softmax over exponentials with a bounded quadratic functional: ${\color{red}J_{\rm RPC}(X,Y)}:={\rm sup}_{f\in\mathcal{F}\, \mathbb{E}_{P_{XY}[f(x,y)] -\alpha \mathbb{E}_{P_XP_Y}[f(x,y)] -\frac{\beta}{2} \mathbb{E}_{P_{XY}\left[f^{2}(x,y)\right] -\frac{\gamma}{2}\mathbb{E}_{P_XP_Y}\left[f^{2}(x,y)\right] }.$ The paper argues that removing log and exp improves stability and reduces minibatch sensitivity while preserving the predictive setup of CPC in vision and speech (Tsai et al., 2021).

These comparisons show that PRL is not synonymous with any single loss family. It can be non-contrastive, contrastive, decoder-anchored, or purely latent. What remains invariant is the requirement that representation learning be driven by prediction of unseen or future structure.

3. Core mechanisms and objectives

A central mechanism in PRL is latent-space prediction of future or missing states. In SimTPR, sequences $c(x)$0 are encoded into $c(x)$1, processed by a causal transformer transition model $c(x)$2, and mapped by a predictor $c(x)$3 into future latent predictions $c(x)$4 (Lee et al., 2023). The main predictive similarity term is

$c(x)$5

with $c(x)$6 in the main experiments, and the symmetrized loss is

$c(x)$7

This is explicitly framed as causal 1-step latent prediction across augmentations (Lee et al., 2023).

A second mechanism is predictive information maximization. Deep Autoencoding Predictive Components defines predictive information as mutual information between past and future latent windows: $c(x)$8 and, under a Gaussian assumption, obtains the closed form

$c(x)$9

DAPC then combines predictive information with masked or shifted reconstruction: $t(x)$0 The paper’s empirical conclusion is that predictive information alone is insufficient, while predictive information plus masked reconstruction yields robust latent recovery and forecasting improvements (Bai et al., 2020).

A third mechanism is predictive state construction through explicit future quantities. In autonomous driving, the predictive state vector is

$t(x)$1

where the $t(x)$2 are GVFs predicting future lane centeredness and road angle under a fixed target policy (Graves et al., 2020). These predictions are learned off-policy with importance sampling and importance resampling, and then used as the agent’s state for downstream RL control (Graves et al., 2020). The paper stresses that this representation is counterfactual and multi-timescale, rather than a static feature embedding (Graves et al., 2020).

A fourth mechanism is explicit process-level predictive supervision. In LLM reasoning, Process Reward Learning derives per-step process rewards from a KL-regularized RL objective so that trajectory-level supervision is decomposed into token- or step-level signals (Yao et al., 15 Jan 2026). Although this work uses “PRL” to denote Process Reward Learning rather than Predictive Representation Learning, it still exemplifies the broader predictive principle of replacing sparse terminal supervision with structured intermediate prediction-derived signals (Yao et al., 15 Jan 2026).

4. Anti-collapse strategies and latent geometry

A recurring technical issue in PRL is representational collapse. SimTPR states that non-contrastive future prediction can collapse the latent subspace into a low-dimensional manifold and proposes feature decorrelation as an anti-collapse mechanism (Lee et al., 2023). The decorrelation objective is built from the cross-correlation matrix

$t(x)$3

with loss

$t(x)$4

Combined with the predictive similarity term as

$t(x)$5

this yields high-rank features and the best Atari 100k finetuning performance at moderate $t(x)$6 (Lee et al., 2023).

The empirical evidence in that paper is unusually explicit. Similarity-only training gives feature rank 156 and IQM 0.189; contrastive augmentation raises rank to 443 and IQM to 0.331; batch normalization in the projector yields rank 305 but IQM only 0.068; decorrelation alone gives rank 421 and IQM 0.451; combining decorrelation with contrastive or BN yields rank 472–500 but lower IQM, 0.342 and 0.264 respectively (Lee et al., 2023). The authors conclude that repulsive mechanisms can preserve rank but may damage local temporal neighborhood structure, whereas decorrelating features preserves nearby states as similar while increasing capacity (Lee et al., 2023).

RePAIR reports a different failure mode: pure JEPA-style latent alignment can cause representation collapse, so the final model relies on decoder losses to anchor the latent space (Koller et al., 10 Jun 2026). It studies three losses: latent alignment,

$t(x)$7

decoder loss through the predictor,

$t(x)$8

and direct autoencoding decoder loss,

$t(x)$9

The paper reports that only $c(x)$0 leads to predictor collapse, whereas any combination including $c(x)$1 yields strong performance, around $c(x)$2 top-1 accuracy with 80% masking, and the main model uses $c(x)$3 (Koller et al., 10 Jun 2026).

DAPC addresses degeneracy differently. It combines predictive information with masked reconstruction and an orthogonality regularizer

$c(x)$4

thereby encouraging approximately Gaussian, decorrelated latent coordinates while preserving input-relevant information (Bai et al., 2020). This suggests that PRL systems often need both a predictive objective and a structural regularizer or anchoring term to avoid trivial or low-capacity solutions.

5. Domain-specific instantiations

In chess, RePAIR models a sequence of board states $c(x)$5, where each $c(x)$6 encodes piece occupancies, empty squares, castling rights, en passant square, and side to move (Koller et al., 10 Jun 2026). Games are truncated or padded to 100 states, and the predictor uses RoPE for relative positional encoding (Koller et al., 10 Jun 2026). The authors report that PCA and t-SNE of learned embeddings reveal clusters corresponding to openings, pre- and post-castling middlegame, transition to endgame, and endgames with few pieces (Koller et al., 10 Jun 2026). On the ECO openings dataset of 3,627 standardized opening positions, encoder embeddings show clearer separation by ECO group than raw bitmaps, and on the Lichess puzzle dataset motif-specific clusters become well separated in latent space (Koller et al., 10 Jun 2026). Qualitative reconstructions of masked positions indicate that the model respects pawn structure constraints, possible piece trajectories, and legality of moves, even over long gaps (Koller et al., 10 Jun 2026).

In offline reinforcement learning, SimTPR pretrains on 1.5M frames from the DQN Replay dataset and finetunes a frozen encoder with a Rainbow Q-learning head for Atari 100k (Lee et al., 2023). It uses a convolutional encoder, a 2-layer MLP projector with 512 hidden units, a 2-block causal transformer with 8 heads as transition model, and a 2-layer MLP predictor (Lee et al., 2023). Compared with DrQ, VAE, Barlow Twins, CURL, RSSM, and ATC, SimTPR attains IQM 0.451, outperforming ATC’s 0.353 and RSSM’s 0.302 (Lee et al., 2023). In a demonstration-pretraining regime it reaches IQM 0.500, above BC, IDM, SGI, and BarlowBalance (Lee et al., 2023).

In autonomous driving, predictive representations are not latent predictions of abstract embeddings but compact vectors of GVF forecasts (Graves et al., 2020). The driving system predicts future lane centeredness $c(x)$7 and road angle $c(x)$8 under a fixed policy at multiple discount factors $c(x)$9 (Graves et al., 2020). In TORCS, the multi-timescale GVF representation improves learning speed, stability, and jerkiness relative to DDPG from images or privileged low-dimensional features (Graves et al., 2020). On the Clearpath Jackal robot, the learned representation is an 11-dimensional vector comprising 8 GVFs plus last steering action, last target speed action, and current speed, and supports BCQ trained offline from about 40 hours of data (Graves et al., 2020). The paper reports near-unchanged performance under damaged lane markings and much better comfort scores than MPC on unseen roads (Graves et al., 2020).

In language modeling, PRL augments AWD-LSTM and AWD-LSTM-MoS with auxiliary POS or NER predictors whose outputs are concatenated into the LM hidden state (Lan et al., 2021). On PTB, AWD-PRL-Q with POS auxiliary improves perplexity from 58.48 to 55.90 without cache, and from 54.36 to 51.90 with neural cache (Lan et al., 2021). On WikiText-2, AWD-PRL-Q with POS auxiliary improves perplexity from 68.85 to 66.75 without cache and from 54.24 to 52.58 with cache (Lan et al., 2021). The paper also reports that AWD-PRL-Q reaches AWD’s final PTB perplexity after about 100 epochs, versus 500 epochs for the baseline (Lan et al., 2021).

In partially observable environments, Neural Predictive Belief Representations studies whether one-step frame prediction and CPC variants can recover belief-like neural states $t(x)$0 from observation-action histories (Guo et al., 2018). It concludes that one-step frame prediction, CPC, and action-conditioned CPC all learn representations encoding not only latent state but also uncertainty, and that multi-step prediction and action conditioning are critical in visually complex environments (Guo et al., 2018). Although the provided excerpt is incomplete, the paper’s stated contribution places PRL squarely in the belief-state learning tradition.

6. Empirical patterns, controversies, and open questions

A robust empirical pattern across the literature is that predictive supervision improves downstream performance most clearly when it matches the structure of the target problem. In RL, causal next-state prediction appears preferable to non-causal masked prediction when the downstream objective is control (Lee et al., 2023). In autonomous driving, multi-timescale prediction is necessary: single-$t(x)$1 GVFs diverge, whereas multi-timescale GVFs yield the best performance and smoothest control (Graves et al., 2020). In language modeling, POS-based PRL with Q-predictions improves perplexity more than probability-based predictions, even though the latter achieves higher POS accuracy, suggesting that longer-horizon predictive structure can be more useful than immediate label confidence (Lan et al., 2021).

Another consistent pattern is that prediction alone is rarely enough. RePAIR requires decoder anchoring to avoid collapse (Koller et al., 10 Jun 2026). DAPC requires masked or shifted reconstruction in addition to predictive information (Bai et al., 2020). SimTPR requires feature decorrelation to prevent low-rank collapse (Lee et al., 2023). This suggests that PRL systems often need an additional constraint ensuring that the predictive latent is both non-trivial and information-preserving.

There is also a recurring tension between local prediction and broader semantic abstraction. MAE achieves augmentation similarity $t(x)$2 but only occlusion robustness $t(x)$3, whereas I-JEPA attains $t(x)$4 augmentation similarity and $t(x)$5 occlusion robustness (Dutta et al., 15 Apr 2026). The authors interpret this as a trade-off between optimizing similarity and optimizing robustness under partial observability, with predictive objectives favoring the latter (Dutta et al., 15 Apr 2026). This does not imply that PRL universally dominates reconstruction or alignment, but it does support the claim that predictive objectives bias models toward structural dependencies rather than exact fidelity.

A further issue concerns the meaning of “PRL” across communities. In the protein literature, PRL commonly abbreviates “protein representation learning,” as in the survey of sequence-, structure-, and sequence-structure models (Wu et al., 2022). In control, “predictive reinforcement learning” may refer to using an explicit dynamics model to compute multi-step rewards, rather than learning a predictive latent representation (Ma et al., 10 Jun 2025). In LLM reasoning, “PRL” denotes Process Reward Learning, which is not representation learning in the usual latent-state sense (Yao et al., 15 Jan 2026). This suggests terminological ambiguity rather than conceptual unity, and it is therefore useful to reserve “Predictive Representation Learning” for methods where the representation itself is trained through predictive structure.

Open challenges stated in the recent taxonomy include theoretical understanding of predictive objectives, long-horizon prediction and temporal abstraction, multimodal and cross-modal prediction, scalability and architectural design, predictive benchmarking, robustness under partial observability, and integration into embodied interactive systems (Dutta et al., 15 Apr 2026). A plausible implication is that the next major advances in PRL may come less from introducing isolated new losses and more from clarifying when particular predictive targets—latent states, returns, actions, observations, or structured labels—best match the invariants required by the downstream task.

7. Significance and broader implications

Across the cited work, PRL emerges as a design principle for constructing latent spaces that are semantically organized by what they can predict. In chess, this produces trajectories through latent space that expose game phases and tactical motifs (Koller et al., 10 Jun 2026). In RL, it yields high-rank, dynamics-aware features that improve sample efficiency and robustness (Lee et al., 2023). In driving, it yields compact, interpretable predictive states that support smooth and generalizable control (Graves et al., 2020). In sequence modeling, it yields LLM states that converge faster and exploit structured linguistic predictions (Lan et al., 2021). In sequential self-supervision more broadly, it motivates a taxonomy in which latent prediction of unobserved components is treated as a separate paradigm rather than a special case of masking or alignment (Dutta et al., 15 Apr 2026).

A recurring theoretical intuition across these papers is that useful states are predictive states. SimTPR frames this in terms of causal future prediction and latent manifold rank (Lee et al., 2023). DAPC frames it in terms of mutual information between past and future latent windows (Bai et al., 2020). GVF-based driving frames it as a vector of counterfactual forecasts under a policy (Graves et al., 2020). JEPA-style methods frame it as latent prediction of unseen parts from observed context (Dutta et al., 15 Apr 2026). These are not identical formulations, but they all operationalize the same broad claim: a state representation is valuable insofar as it encodes structure that constrains what comes next.

This suggests that PRL’s long-term significance lies in bridging self-supervised learning, world modeling, predictive state representations, and task-driven abstraction. Rather than treating representation quality as an intrinsic property measurable only by probe accuracy or reconstruction fidelity, PRL defines quality through latent predictive sufficiency. Whether this eventually yields a unified theory remains unresolved, but the current literature already supports a narrower conclusion: when the prediction target is well matched to the environment’s causal or semantic structure, predictive supervision can produce compact, transferable, and interpretable representations that are difficult to obtain from alignment or reconstruction alone (Koller et al., 10 Jun 2026, Lee et al., 2023, Dutta et al., 15 Apr 2026).