Learning Synthetic Environments and Reward Networks for Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
We introduce Synthetic Environments (SEs) and Reward Networks (RNs), represented by neural networks, as proxy environment models for training Reinforcement Learning (RL) agents. We show that an agent, after being trained exclusively on the SE, is able to solve the corresponding real environment. While an SE acts as a full proxy to a real environment by learning about its state dynamics and rewards, an RN is a partial proxy that learns to augment or replace rewards. We use bi-level optimization to evolve SEs and RNs: the inner loop trains the RL agent, and the outer loop trains the parameters of the SE / RN via an evolution strategy. We evaluate our proposed new concept on a broad range of RL algorithms and classic control environments. In a one-to-one comparison, learning an SE proxy requires more interactions with the real environment than training agents only on the real environment. However, once such an SE has been learned, we do not need any interactions with the real environment to train new agents. Moreover, the learned SE proxies allow us to train agents with fewer interactions while maintaining the original task performance. Our empirical results suggest that SEs achieve this result by learning informed representations that bias the agents towards relevant states. Moreover, we find that these proxies are robust against hyperparameter variation and can also transfer to unseen agents.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 28 of its 48 references that are in the map. First posted on arXiv 6 Feb 2022.
Builds on
28 of 48 references.
References · 28
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
- 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
- 2015Deep Reinforcement Learning with Double Q-learningcited by 1,704
- 2017Domain Randomization for Transferring Deep Neural Networks from Simulation to the Real Worldcited by 1,401
- 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,173
- 2015Dueling Network Architectures for Deep Reinforcement Learningcited by 769
- 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 632
- 2017Evolution Strategies as a Scalable Alternative to Reinforcement Learningcited by 555
- 2019Leveraging Procedural Generation to Benchmark Reinforcement Learningcited by 478
- 2018BOHB: Robust and Efficient Hyperparameter Optimization at Scalecited by 466
16 more
- 2018Reward learning from human preferences and demonstrations in Ataricited by 314
- 2016#Exploration: A Study of Count-Based Exploration for Deep Reinforcement Learningcited by 307
- 2018Large-Scale Study of Curiosity-Driven Learningcited by 277
- 2018Human-level performance in first-person multiplayer games with population-based deep reinforcement learningcited by 260
- 2020Emergent Complexity and Zero-shot Transfer via Unsupervised Environment Designcited by 260
- 2017Teacher-Student Curriculum Learningcited by 197
- 2019Paired Open-Ended Trailblazer (POET): Endlessly Generating Increasingly Complex and Diverse Learning Environments and Their Solutionscited by 182
- 2020Learning to Utilize Shaping Rewards: A New Approach of Reward Shapingcited by 112
- 2019Generative Teaching Networks: Accelerating Neural Architecture Search by Learning to Generate Synthetic Training Datacited by 103
- 2018On Learning Intrinsic Rewards for Policy Gradient Methodscited by 100
- 2018Understanding and correcting pathologies in the training of learned optimizerscited by 97
- 2016Fairness in Reinforcement Learningcited by 93
- 2018Evolving Mario Levels in the Latent Space of a Deep Convolutional Generative Adversarial Networkcited by 76
- 2019What Can Learned Intrinsic Rewards Capture?cited by 36
- 2019Reward Shaping via Meta-Learningcited by 30
- 2019Evolving Rewards to Automate Reinforcement Learningcited by 28
Built on by
Citing papers per year: 2023: 1; 2024: 3; 2025: 0; 2026: 2.
6 papers.
- 2023Evolutionary Reinforcement Learning: A Surveycited by 24
- 2026Can LLMs Beat Classical Hyperparameter Optimization Algorithms? A Study on autoresearchcited by 12
- 2024Behaviour Distillationcited by 5
- 2024Discovering Minimal Reinforcement Learning Environmentscited by 3
- 2024One-shot World Models Using a Transformer Trained on a Synthetic Priorcited by 0
- 2026Evolving Many Worlds: Towards Open-Ended Discovery in Petri Dish NCA via Population-Based Trainingcited by 0
- 2026Evolving Many Worlds: Towards Open-Ended Discovery in Petri Dish NCA via Population-Based Training13 Apr 2026
- 2026Can LLMs Beat Classical Hyperparameter Optimization Algorithms? A Study on autoresearch25 Mar 2026
- 2024One-shot World Models Using a Transformer Trained on a Synthetic Prior21 Sep 2024
- 2024Behaviour Distillation21 Jun 2024
- 2024Discovering Minimal Reinforcement Learning Environments18 Jun 2024
- 2023Evolutionary Reinforcement Learning: A Survey7 Mar 2023