Discount Model Search for Quality Diversity Optimization in High-Dimensional Measure Spaces
Not on the map. Why?
Abstract (arXiv)
Quality diversity (QD) optimization searches for a collection of solutions that optimize an objective while attaining diverse outputs of a user-specified, vector-valued measure function. Contemporary QD algorithms are typically limited to low-dimensional measures because high-dimensional measures are prone to distortion, where many solutions found by the QD algorithm map to similar measures. For example, the state-of-the-art CMA-MAE algorithm guides measure space exploration with a histogram in measure space that records so-called discount values. However, CMA-MAE stagnates in domains with high-dimensional measure spaces because solutions with similar measures fall into the same histogram cell and hence receive the same discount value. To address these limitations, we propose Discount Model Search (DMS), which guides exploration with a model that provides a smooth, continuous representation of discount values. In high-dimensional measure spaces, this model enables DMS to distinguish between solutions with similar measures and thus continue exploration. We show that DMS facilitates new capabilities for QD algorithms by introducing two new domains where the measure space is the high-dimensional space of images, which enables users to specify their desired measures by providing a dataset of images rather than hand-designing the measure function. Results in these domains and on high-dimensional benchmarks show that DMS outperforms CMA-MAE and other existing black-box QD algorithms.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 67 of its 99 references that are in the map. First posted on arXiv 3 Jan 2026.
Builds on
67 of 99 references.
References · 67
- 2017Attention Is All You Needcited by 59,932
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,694
- 2018A Style-Based Generator Architecture for Generative Adversarial Networkscited by 5,986
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2021Alias-Free Generative Adversarial Networkscited by 1,181
- 2019Interpreting the Latent Space of GANs for Semantic Face Editingcited by 691
- 2020Closed-Form Factorization of Latent Semantics in GANscited by 407
- 2015Illuminating search spaces by mapping elitescited by 406
- 2020InterFaceGAN: Interpreting the Disentangled Face Representation Learned by GANscited by 393
38 more
- 2016The CMA Evolution Strategy: A Tutorialcited by 364
- 2020Unsupervised Discovery of Interpretable Directions in the GAN Latent Spacecited by 288
- 2014Robots that can adapt like animalscited by 203
- 2023Glaze: Protecting Artists from Style Mimicry by Text-to-Image Modelscited by 200
- 2024Rainbow Teaming: Open-Ended Generation of Diverse Adversarial Promptscited by 189
- 2022Defining and Characterizing Reward Hackingcited by 184
- 2017Quality and Diversity Optimization: A Unifying Modular Frameworkcited by 111
- 2021Regularizing Generative Adversarial Networks under Limited Datacited by 105
- 2017A Tutorial on Kernel Density Estimation and Recent Advancescited by 100
- 2020Controlling generative models with continuous factors of variationscited by 93
- 2019Covariance Matrix Adaptation for the Rapid Illumination of Behavior Spacecited by 78
- 2018Evolving Mario Levels in the Latent Space of a Deep Convolutional Generative Adversarial Networkcited by 76
- 2021Differentiable Quality Diversitycited by 71
- 2021Aligning Latent and Image Spaces to Connect the Unconnectablecited by 70
- 2016Using Centroidal Voronoi Tessellations to Scale Up the Multi-dimensional Archive of Phenotypic Elites Algorithmcited by 65
- 2020EGAD! an Evolved Grasping Analysis Dataset for diversity and reproducibility in robotic manipulationcited by 61
- 2019Autonomous skill discovery with Quality-Diversity and Unsupervised Descriptorscited by 57
- 2020Diversity Policy Gradient for Sample Efficient Quality-Diversity Optimizationcited by 53
- 2020Illuminating Mario Scenes in the Latent Space of a Generative Adversarial Networkcited by 51
- 2023Analyzing Bias in Diffusion-based Face Generation Modelscited by 45
- 2018Discovering the Elite Hypervolume by Leveraging Interspecies Correlationcited by 40
- 2021Modern Evolution Strategies for Creativity: Fitting Concrete Images and Abstract Conceptscited by 40
- 2022Deep Surrogate Assisted Generation of Environmentscited by 40
- 2023Quality-Diversity through AI Feedbackcited by 40
- 2018Data-Efficient Design Exploration through Surrogate-Assisted Illuminationcited by 38
- 2021On the Importance of Environments in Human-Robot Coordinationcited by 37
- 2022Approximating Gradients for Differentiable Quality Diversity in Reinforcement Learningcited by 37
- 2022Studying Bias in GANs through the Lens of Racecited by 31
- 2022EvoJAX: Hardware-Accelerated Neuroevolutioncited by 29
- 2023pyribs: A Bare-Bones Python Library for Quality Diversity Optimizationcited by 29
- 2021Generating and Blending Game Levels via Quality-Diversity in the Latent Space of a Variational Autoencodercited by 27
- 2021Deep Surrogate Assisted MAP-Elites for Automated Hearthstone Deckbuildingcited by 26
- 2022Covariance Matrix Adaptation MAP-Annealingcited by 24
- 2019Unsupervised Learning and Exploration of Reachable Outcome Spacecited by 23
- 2022Neuroevolution is a Competitive Alternative to Reinforcement Learning for Skill Discoverycited by 23
- 2021Policy Manifold Search: Exploring the Manifold Hypothesis for Diversity-based Neuroevolutioncited by 20
- 2023Proximal Policy Gradient Arborescence for Quality Diversity Reinforcement Learningcited by 20
- 2020CPPN2GAN: Combining Compositional Pattern Producing Networks and GANs for Large-scale Pattern Generationcited by 19
50 most cited of 67 All 67 (JSON)
Built on by
Citing papers per year: 2026: 1.
1 paper.