🤖 AI Summary
This work investigates the mechanistic impact of sparse architectural designs on the performance of image-input deep reinforcement learning (DRL). Addressing a critical gap—prior studies overlook how weight trainability modulates sparsity benefits—we systematically compare spatially biased, local convolutional, randomly sparse fully connected, and topologically constrained graph network architectures, all with matched parameter counts, under both fixed-weight and trainable-weight hidden-layer configurations. Evaluations are conducted within the DQN and IMPALA frameworks on the Atari and DeepMind Lab benchmarks. Our key finding is that the optimal sparse architecture is strongly contingent on weight trainability—a previously unrecognized coupling between sparsity gains and parameter optimization dynamics. Specifically, under trainable-weight conditions, certain sparse structures improve sample efficiency by up to 37%; conversely, the best-performing architecture shifts markedly when weights are frozen. This demonstrates that sparsity-induced improvements are not task-agnostic but fundamentally intertwined with gradient-based learning mechanisms.
📝 Abstract
We study the benefits of different sparse architectures for deep reinforcement learning. In particular, we focus on image-based domains where spatially-biased and fully-connected architectures are common. Using these and several other architectures of equal capacity, we show that sparse structure has a significant effect on learning performance. We also observe that choosing the best sparse architecture for a given domain depends on whether the hidden layer weights are fixed or learned.