Neural Network Optimization for Reinforcement Learning Tasks Using Sparse Computations
Not on the map. Why?
Abstract (arXiv)
This article proposes a sparse computation-based method for optimizing neural networks for reinforcement learning (RL) tasks. This method combines two ideas: neural network pruning and taking into account input data correlations; it makes it possible to update neuron states only when changes in them exceed a certain threshold. It significantly reduces the number of multiplications when running neural networks. We tested different RL tasks and achieved 20-150x reduction in the number of multiplications. There were no substantial performance losses; sometimes the performance even improved.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 7 of its 18 references that are in the map. First posted on arXiv 7 Jan 2022.
Builds on
7 of 18 references.
References · 7
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2020What is the State of Neural Network Pruning?cited by 578
- 2019Playing the lottery with rewards and multiple languages: lottery tickets in RL and NLPcited by 73
- 2019Learning Sparse Networks Using Targeted Dropoutcited by 40
- 2021On Lottery Tickets and Minimal Task Representations in Deep Reinforcement Learningcited by 23
- 2016Delta Networks for Optimized Recurrent Network Computationcited by 18
- 2016Sigma Delta Quantized Networkscited by 13
Built on by
Not cited yet.