← Back to all news
arXiv Machine Learning By Tommaso Giorgi, Pierriccardo Olivieri, Keyue Jiang, Laura Toni, Matteo Papini

Impact of Connectivity on Laplacian Representations in Reinforcement Learning

Read the original on arXiv Machine Learning →

arXiv:2603. 08558v3 Announce Type: replace Abstract: Learning compact state representations in Markov Decision Processes (MDPs) has proven crucial for addressing the curse of dimensionality in large-scale reinforcement learning (RL) problems.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv AI
Jul 8

Learning The Minimum Action Distance

arXiv:2506. 09276v4 Announce Type: replace-cross Abstract: This paper presents a state representation framework for Markov decision processes (MDPs) that can be learned solely from state trajectories, requiring neither reward signals nor the actions executed by the agent.

By Lorenzo Steccanella, Joshua B. Evans, \"Ozg\"ur \c{S}im\c{s}ek, Anders Jonsson
ragagentsreinforcement-learning
More like this →
arXiv Machine Learning
Jul 22

Scalable Policy Optimization for Networked Multi-Agent Reinforcement Learning with Continuous State-Action Spaces

arXiv:2607. 18554v1 Announce Type: cross Abstract: We develop the Continuous Distributed Coupled Policy Gradient (CDCPG) algorithm for cooperative reinforcement learning in networked Markov decision processes with continuous state and action spaces.

By Dongming Wang, Pengcheng Dai, Wenwu Yu, Wei Ren
agentsreinforcement-learningbenchmarks
More like this →
arXiv Machine Learning
Aug 31

Shift Before You Learn: Enabling Low-Rank Representations in Reinforcement Learning

The paper challenges the common assumption that the successor measure in reinforcement learning is approximately low-rank, showing instead that a low-rank structure emerges in a shifted successor measure that ignores initial transitions. It provides finite-sample guarantees for estimating this low-rank approximation, introduces Type II Poincaré inequalities to bound spectral recoverability, and links the necessary shift to the decay of high-order singular values and local mixing properties. Experiments confirm that shifting the successor measure improves goal-conditioned RL performance.

By Bastien Dubail, Stefan Stojanovic, Alexandre Prouti\`ere
reinforcement-learning
More like this →