Table of Contents
Fetching ...

1000 Layer Networks for Self-Supervised RL: Scaling Depth Can Enable New Goal-Reaching Capabilities

Kevin Wang, Ishaan Javali, Michał Bortkiewicz, Tomasz Trzciński, Benjamin Eysenbach

TL;DR

The paper investigates whether increasing network depth can unlock new capabilities in self-supervised reinforcement learning. By integrating contrastive RL with a deep, residual architecture, it demonstrates substantial performance gains across ten goal-conditioned tasks and reveals qualitatively new behaviors that emerge at specific depths. The work identifies key factors enabling scaling—depth over width, joint actor-critic scaling, and batch-size interactions—and shows that deeper models can harness more data coverage to improve exploration and representation. Offline results suggest depth scaling is most effective in online CRL, highlighting the potential of very deep self-supervised RL for scalable, autonomous goal-reaching agents.

Abstract

Scaling up self-supervised learning has driven breakthroughs in language and vision, yet comparable progress has remained elusive in reinforcement learning (RL). In this paper, we study building blocks for self-supervised RL that unlock substantial improvements in scalability, with network depth serving as a critical factor. Whereas most RL papers in recent years have relied on shallow architectures (around 2 - 5 layers), we demonstrate that increasing the depth up to 1024 layers can significantly boost performance. Our experiments are conducted in an unsupervised goal-conditioned setting, where no demonstrations or rewards are provided, so an agent must explore (from scratch) and learn how to maximize the likelihood of reaching commanded goals. Evaluated on simulated locomotion and manipulation tasks, our approach increases performance on the self-supervised contrastive RL algorithm by $2\times$ - $50\times$, outperforming other goal-conditioned baselines. Increasing the model depth not only increases success rates but also qualitatively changes the behaviors learned. The project webpage and code can be found here: https://wang-kevin3290.github.io/scaling-crl/.

1000 Layer Networks for Self-Supervised RL: Scaling Depth Can Enable New Goal-Reaching Capabilities

TL;DR

The paper investigates whether increasing network depth can unlock new capabilities in self-supervised reinforcement learning. By integrating contrastive RL with a deep, residual architecture, it demonstrates substantial performance gains across ten goal-conditioned tasks and reveals qualitatively new behaviors that emerge at specific depths. The work identifies key factors enabling scaling—depth over width, joint actor-critic scaling, and batch-size interactions—and shows that deeper models can harness more data coverage to improve exploration and representation. Offline results suggest depth scaling is most effective in online CRL, highlighting the potential of very deep self-supervised RL for scalable, autonomous goal-reaching agents.

Abstract

Scaling up self-supervised learning has driven breakthroughs in language and vision, yet comparable progress has remained elusive in reinforcement learning (RL). In this paper, we study building blocks for self-supervised RL that unlock substantial improvements in scalability, with network depth serving as a critical factor. Whereas most RL papers in recent years have relied on shallow architectures (around 2 - 5 layers), we demonstrate that increasing the depth up to 1024 layers can significantly boost performance. Our experiments are conducted in an unsupervised goal-conditioned setting, where no demonstrations or rewards are provided, so an agent must explore (from scratch) and learn how to maximize the likelihood of reaching commanded goals. Evaluated on simulated locomotion and manipulation tasks, our approach increases performance on the self-supervised contrastive RL algorithm by - , outperforming other goal-conditioned baselines. Increasing the model depth not only increases success rates but also qualitatively changes the behaviors learned. The project webpage and code can be found here: https://wang-kevin3290.github.io/scaling-crl/.

Paper Structure

This paper contains 42 sections, 4 equations, 21 figures, 7 tables.

Figures (21)

  • Figure 1: Scaling network depth yields performance gains across a suite of locomotion, navigation, and manipulation tasks, ranging from doubling performance to 50× improvements on Humanoid-based tasks. Notably, rather than scaling smoothly, performance often jumps at specific critical depths (e.g., 8 layers on Ant Big Maze, 64 on Humanoid U-Maze), which correspond to the emergence of qualitatively distinct policies (see Section \ref{['sec:experiments']}).
  • Figure 2: Architecture. Our approach integrates residual connections into both the actor and critic networks of the Contrastive RL algorithm. The depth of this residual architecture is defined as the total number of Dense layers across the residual blocks, which, with our residual block size of 4, equates to $4N$.
  • Figure 3: Increasing depth results in new capabilities:Row 1: A depth-4 agent collapses and throws itself toward the goal. Row 2: A depth-16 agent walks upright. Row 3: A depth-64 agent struggles and falls. Row 4: A depth-256 agent vaults the wall acrobatically.
  • Figure 4: Scaling network width vs. depth. Here, we reflect findings from previous works leeSimBaSimplicityBias2024naumanBiggerRegularizedOptimistic2024 which suggest that increasing network width can enhance performance. However, in contrast to prior work, our method is able to scale depth, yielding more impactful performance gains. For instance, in the Humanoid environment, raising the width to 2048 (depth=4) fails to match the performance achieved by simply doubling the depth to 8 (width=256). The comparative advantage of scaling depth is more pronounced as the observational dimensionality increases.
  • Figure 5: Critical depth and residual connections. Incrementally increasing depth results in marginal performance gains (left). However, once a critical threshold is reached, performance improves dramatically (right) for networks with residual connections.
  • ...and 16 more figures