mlsanityData to 14 Oct 2026

Unified Policy Value Decomposition for Rapid Adaptation

arXiv 2603.17947 ↗First posted 18 Mar 2026cs.LG q-bio.NCcited by 0

On the map: Deep reinforcement learning methods → Deep RL algorithms and representations

Abstract (arXiv)

Rapid adaptation in complex control systems remains a central challenge in reinforcement learning. We introduce a framework in which policy and value functions share a low-dimensional coefficient vector - a goal embedding - that captures task identity and enables immediate adaptation to novel tasks without retraining representations. During pretraining, we jointly learn structured value bases and compatible policy bases through a bilinear actor-critic decomposition. The critic factorizes as Q = sum_k G_k(g) y_k(s,a), where G_k(g) is a goal-conditioned coefficient vector and y_k(s,a) are learned value basis functions. This multiplicative gating - where a context signal scales a set of state-dependent bases - is reminiscent of gain modulation observed in Layer 5 pyramidal neurons, where top-down inputs modulate the gain of sensory-driven responses without altering their tuning. Building on Successor Features, we extend the decomposition to the actor, which composes a set of primitive policies weighted by the same coefficients G_k(g). At test time the bases are frozen and G_k(g) is estimated zero-shot via a single forward pass, enabling immediate adaptation to novel tasks without any gradient update. We train a Soft Actor-Critic agent on the MuJoCo Ant environment under a multi-directional locomotion objective, requiring the agent to walk in eight directions specified as continuous goal vectors. The bilinear structure allows each policy head to specialize to a subset of directions, while the shared coefficient layer generalizes across them, accommodating novel directions by interpolating in goal embedding space. Our results suggest that shared low-dimensional goal embeddings offer a general mechanism for rapid, structured adaptation in high-dimensional control, and highlight a potentially biologically plausible principle for efficient transfer in complex reinforcement learning systems.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Deep RL algorithms and representations, one of 15 directions in Deep reinforcement learning methods. Builds on 7 of its 20 references that are in the map. First posted on arXiv 18 Mar 2026.

Builds on

7 of 20 references.

References · 7

  1. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
  2. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,509
  3. 2016Deep Exploration via Bootstrapped DQNcited by 527
  4. 2016Successor Features for Transfer in Reinforcement Learningcited by 340
  5. 2021Randomized Ensembled Double Q-Learning: Learning Fast Without a Modelcited by 288
  6. 2016Modular Multitask Reinforcement Learning with Policy Sketchescited by 203
  7. 2024Adaptive behavior with stable synapsescited by 1

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025Fast Adaptation with Behavioral Foundation Models
  2. 2025Pretrain Value, Not Reward: Decoupled Value Policy Optimization
  3. 2026Towards Zero-Shot Task Transfer with Neurosymbolic World Models
  4. 2026Action-Sufficient Goal Representations
  5. 2026What Makes Value Learning Efficient in Residual Reinforcement Learning?
  6. 2025Spectral Representation-based Reinforcement Learning
  7. 2025Actor-Free Continuous Control via Structurally Maximizable Q-Functions
  8. 2026Decoupled Behavioral Cloning for Scalable Inductive Generalization in RL from Specifications