mlsanityData to 7 Oct 2026

Learning One Abstract Bit at a Time Through Self-Invented Experiments Encoded as Neural Networks

arXiv 2212.14374 ↗First posted 29 Dec 2022cs.LG cs.AIcited by 4

Not on the map. Why?

Abstract (arXiv)

There are two important things in science: (A) Finding answers to given questions, and (B) Coming up with good questions. Our artificial scientists not only learn to answer given questions, but also continually invent new questions, by proposing hypotheses to be verified or falsified through potentially complex and time-consuming experiments, including thought experiments akin to those of mathematicians. While an artificial scientist expands its knowledge, it remains biased towards the simplest, least costly experiments that still have surprising outcomes, until they become boring. We present an empirical analysis of the automatic generation of interesting experiments. In the first setting, we investigate self-invented experiments in a reinforcement-providing environment and show that they lead to effective exploration. In the second setting, pure thought experiments are implemented as the weights of recurrent neural networks generated by a neural experiment generator. Initially interesting thought experiments may become boring over time.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 23 of its 85 references that are in the map. First posted on arXiv 29 Dec 2022.

Builds on

23 of 85 references.

References · 23

  1. 2015Continuous control with deep reinforcement learningcited by 3,279
  2. 2016Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translationcited by 1,471
  3. 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,173
  4. 2019Dota 2 with Large Scale Deep Reinforcement Learningcited by 1,084
  5. 2016HyperNetworkscited by 1,003
  6. 2014Deep Learning in Neural Networks: An Overviewcited by 765
  7. 2018Learning Dexterous In-Hand Manipulationcited by 643
  8. 2021Linear Transformers Are Secretly Fast Weight Programmerscited by 471
  9. 2018Large-Scale Study of Curiosity-Driven Learningcited by 277
  10. 2017Parameter Space Noise for Explorationcited by 158
  11. 2021Going Beyond Linear Transformers with Recurrent Fast Weight Programmerscited by 84
  12. 2015On Learning to Think: Algorithmic Information Theory for Novel Combinations of Reinforcement Learning Controllers and Recurrent Neural World Modelscited by 52
11 more
  1. 2020Meta Learning Backpropagation And Improving Itcited by 49
  2. 2020Policy Evaluation Networkscited by 28
  3. 2018Learning to Reason with Third-Order Tensor Productscited by 27
  4. 2019Contrasting Exploration in Parameter and Action Space: A Zeroth-Order Optimization Perspectivecited by 26
  5. 2020Parameter-Based Value Functionscited by 24
  6. 2019Generative Adversarial Networks are Special Cases of Artificial Curiosity (1990) and also Closely Related to Predictability Minimization (1991)cited by 17
  7. 2018One Big Net For Everythingcited by 13
  8. 2022General Policy Evaluation and Improvement by Learning to Identify Few But Crucial Statescited by 10
  9. 2022Exploring through Random Curiosity with General Value Functionscited by 10
  10. 2022Goal-Conditioned Generators of Deep Policiescited by 9
  11. 2020Deep Learning: Our Miraculous Year 1990-1991cited by 1

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 2; 2025: 1.

4 papers.