mlsanityData to 7 Oct 2026

Nuclear Norm Maximization Based Curiosity-Driven Learning

arXiv 2205.10484 ↗First posted 21 May 2022cs.LG cs.AIcited by 4

Not on the map. Why?

Abstract (arXiv)

To handle the sparsity of the extrinsic rewards in reinforcement learning, researchers have proposed intrinsic reward which enables the agent to learn the skills that might come in handy for pursuing the rewards in the future, such as encouraging the agent to visit novel states. However, the intrinsic reward can be noisy due to the undesirable environment's stochasticity and directly applying the noisy value predictions to supervise the policy is detrimental to improve the learning performance and efficiency. Moreover, many previous studies employ ℓ2 norm or variance to measure the exploration novelty, which will amplify the noise due to the square operation. In this paper, we address aforementioned challenges by proposing a novel curiosity leveraging the nuclear norm maximization (NNM), which can quantify the novelty of exploring the environment more accurately while providing high-tolerance to the noise and outliers. We conduct extensive experiments across a variety of benchmark environments and the results suggest that NNM can provide state-of-the-art performance compared with previous curiosity methods. On 26 Atari games subset, when trained with only intrinsic reward, NNM achieves a human-normalized score of 1.09, which doubles that of competitive intrinsic rewards-based approaches. Our code will be released publicly to enhance the reproducibility.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 24 of its 41 references that are in the map. First posted on arXiv 21 May 2022.

Builds on

24 of 41 references.

References · 24

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,173
  3. 2018Exploration by Random Network Distillationcited by 966
  4. 2017Rainbow: Combining Improvements in Deep Reinforcement Learningcited by 774
  5. 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 632
  6. 2020Image Augmentation Is All You Need: Regularizing Deep Reinforcement Learning from Pixelscited by 573
  7. 2020dm_control: Software and Tasks for Continuous Controlcited by 368
  8. 2020Data-Efficient Reinforcement Learning with Self-Predictive Representationscited by 309
  9. 2018Large-Scale Study of Curiosity-Driven Learningcited by 277
  10. 2019Self-Supervised Exploration via Disagreementcited by 263
  11. 2017Count-Based Exploration with Neural Density Modelscited by 255
  12. 2020Never Give Up: Learning Directed Exploration Strategiescited by 210
12 more
  1. 2021Reinforcement Learning with Prototypical Representationscited by 179
  2. 2021Behavior From the Void: Unsupervised Active Pre-Trainingcited by 173
  3. 2015Incentivizing Exploration In Reinforcement Learning With Deep Predictive Modelscited by 154
  4. 2021URLB: Unsupervised Reinforcement Learning Benchmarkcited by 138
  5. 2020Towards Discriminability and Diversity: Batch Nuclear-norm Maximization under Label Insufficient Situationscited by 133
  6. 2021APS: Active Pretraining with Successor Featurescited by 109
  7. 2017Count-Based Exploration in Feature Space for Reinforcement Learningcited by 48
  8. 2020See, Hear, Explore: Curiosity via Audio-Visual Associationcited by 43
  9. 2020Novelty Search in Representational Space for Sample Efficient Explorationcited by 26
  10. 2022Sample Efficient Deep Reinforcement Learning via Uncertainty Estimationcited by 26
  11. 2018Low Rank Regularization: A Reviewcited by 15
  12. 2019Factor Group-Sparse Regularization for Efficient Low-Rank Matrix Recoverycited by 15

Built on by

Cited by year

Citing papers per year: 2022: 2; 2023: 2.

4 papers.