mlsanityData to 14 Oct 2026

Spectral Bellman Method: Unifying Representation and Exploration in RL

arXiv 2507.13181 ↗First posted 17 Jul 2025cs.LGcited by 4

On the map: Deep reinforcement learning methods → RL theory and sample complexity

Abstract (arXiv)

Representation learning is critical to the empirical and theoretical success of reinforcement learning. However, many existing methods are induced from model-learning aspects, misaligning them with the RL task in hand. This work introduces the Spectral Bellman Method, a novel framework derived from the Inherent Bellman Error (IBE) condition. It aligns representation learning with the fundamental structure of Bellman updates across a textitspace of possible value functions, making it directly suited for value-based RL. Our key insight is a fundamental spectral relationship: under the zero-IBE condition, the transformation of a textitdistribution of value functions by the Bellman operator is intrinsically linked to the feature covariance structure. This connection yields a new, theoretically-grounded objective for learning state-action features that capture this Bellman-aligned covariance, requiring only a simple modification to existing algorithms. We demonstrate that our learned representations enable structured exploration by aligning feature covariance with Bellman dynamics, improving performance in hard-exploration and long-horizon tasks. Our framework naturally extends to multi-step Bellman operators, offering a principled path toward learning more powerful and structurally sound representations for value-based RL.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Placed in RL theory and sample complexity, one of 15 directions in Deep reinforcement learning methods. Builds on 38 of its 51 references that are in the map. First posted on arXiv 17 Jul 2025.

Builds on

38 of 51 references.

References · 38

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2017Proximal Policy Optimization Algorithmscited by 15,215
  3. 2013Playing Atari with Deep Reinforcement Learningcited by 3,274
  4. 2019Mastering Atari, Go, Chess and Shogi by Planning with a Learned Modelcited by 1,353
  5. 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,194
  6. 2019An Introduction to Variational Autoencoderscited by 1,000
  7. 2018IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architecturescited by 883
  8. 2017A Distributional Perspective on Reinforcement Learningcited by 765
  9. 2020CURL: Contrastive Unsupervised Representations for Reinforcement Learningcited by 760
  10. 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 639
  11. 2016Deep Exploration via Bootstrapped DQNcited by 527
  12. 2019Provably Efficient Reinforcement Learning with Linear Function Approximationcited by 520
26 more
  1. 2020Learning Invariant Representations for Reinforcement Learning without Reconstructioncited by 436
  2. 2016Successor Features for Transfer in Reinforcement Learningcited by 340
  3. 2020Data-Efficient Reinforcement Learning with Self-Predictive Representationscited by 318
  4. 2020Agent57: Outperforming the Atari Human Benchmarkcited by 303
  5. 2016Safe and Efficient Off-Policy Reinforcement Learningcited by 264
  6. 2013(More) Efficient Reinforcement Learning via Posterior Samplingcited by 233
  7. 2020FLAMBE: Structural Complexity and Representation Learning of Low Rank MDPscited by 233
  8. 2019Reinforcement Learning in Feature Space: Matrix Bandit, Kernels, and Regret Boundcited by 201
  9. 2020Learning Near Optimal Policies with Low Inherent Bellman Errorcited by 181
  10. 2015Action-Conditional Video Prediction using Deep Networks in Atari Gamescited by 172
  11. 2019Is a Good Representation Sufficient for Sample Efficient Reinforcement Learning?cited by 140
  12. 2021Learning One Representation to Optimize All Rewardscited by 115
  13. 2018The Laplacian in RL: Learning Representations with Efficient Approximationscited by 86
  14. 2021Model-free Representation Learning and Exploration in Low-rank MDPscited by 82
  15. 2018Efficient Exploration through Bayesian Deep Q-Networkscited by 67
  16. 2020Provably Efficient Reward-Agnostic Navigation with Linear Value Iterationcited by 56
  17. 2022Making Linear MDPs Practical via Contrastive Representation Learningcited by 52
  18. 2018Observe and Look Further: Achieving Consistent Performance on Ataricited by 44
  19. 2023Proto-Value Networks: Scaling Representation Learning with Auxiliary Taskscited by 42
  20. 2025Towards General-Purpose Model-Free Reinforcement Learningcited by 41
  21. 2022Spectral Decomposition Representation for Reinforcement Learningcited by 36
  22. 2018Beyond the One Step Greedy Approach in Reinforcement Learningcited by 20
  23. 2024Diffusion Spectral Representation for Reinforcement Learningcited by 15
  24. 2015Scale Up Nonlinear Component Analysis with Doubly Stochastic Gradientscited by 6
  25. 2025Representation Learning via Non-Contrastive Mutual Informationcited by 5
  26. 2023Representation-Driven Reinforcement Learningcited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 3.

4 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Bellman Calibration for V-Learning in Offline Reinforcement Learning
  2. 2025Spectral Representation-based Reinforcement Learning
  3. 2024Nonparametric Bellman Mappings for Reinforcement Learning: Application to Robust Adaptive Filtering
  4. 2026A Spectral Revisit of the Distributional Bellman Operator under the Cram'er Metric
  5. 2025Gradual Transition from Bellman Optimality Operator to Bellman Operator in Online Reinforcement Learning
  6. 2025Theoretical Barriers in Bellman-Based Reinforcement Learning
  7. 2025Bellman operator convergence enhancements in reinforcement learning algorithms
  8. 2022Learning Bellman Complete Representations for Offline Policy Evaluation