A Generative Neural Annealer for Black-Box Combinatorial Optimization
Not on the map. Why?
Abstract (arXiv)
We propose a generative, end-to-end solver for black-box combinatorial optimization that emphasizes both sample efficiency and solution quality on NP problems. Drawing inspiration from annealing-based algorithms, we treat the black-box objective as an energy function and train a neural network to model the associated Boltzmann distribution. By conditioning on temperature, the network captures a continuum of distributions--from near-uniform at high temperatures to sharply peaked around global optima at low temperatures--thereby learning the structure of the energy landscape and facilitating global optimization. When queries are expensive, the temperature-dependent distributions naturally enable data augmentation and improve sample efficiency. When queries are cheap but the problem remains hard, the model learns implicit variable interactions, effectively "opening" the black box. We validate our approach on challenging combinatorial tasks under both limited and unlimited query budgets, showing competitive performance against state-of-the-art black-box optimizers.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 23 of its 52 references that are in the map. First posted on arXiv 14 May 2025.
Builds on
23 of 52 references.
References · 23
- 2017Attention Is All You Needcited by 60,361
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 623
- 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 608
- 2017Learning Combinatorial Optimization Algorithms over Graphscited by 561
- 2021Flow Network based Generative Models for Non-Iterative Diverse Candidate Generationcited by 392
- 2020Reinforcement Learning for Combinatorial Optimization: A Surveycited by 236
- 2021Bayesian Optimization is Superior to Random Search for Machine Learning Hyperparameter Tuning: Analysis of the Black-Box Optimization Challenge 2020cited by 148
- 2023Tree-Structured Parzen Estimator: Understanding Its Algorithm Components and Their Roles for Better Empirical Performancecited by 147
- 2018Solving Statistical Mechanics Using Variational Autoregressive Networkscited by 100
- 2019Combinatorial Bayesian Optimization using the Graph Cartesian Productcited by 79
- 2020Learning Combinatorial Optimization on Graphs: A Survey with Applications to Networkingcited by 70
11 more
- 2023Robust Scheduling with GFlowNetscited by 69
- 2018Bayesian Optimization of Combinatorial Structurescited by 64
- 2023GFlowNets for AI-Driven Scientific Discoverycited by 63
- 2024A Diffusion Model Framework for Unsupervised Neural Combinatorial Optimizationcited by 59
- 2023Local Search GFlowNetscited by 48
- 2021Variational Neural Annealingcited by 47
- 2020Mercer Features for Efficient Combinatorial Bayesian Optimizationcited by 27
- 2023Learning to Scale Logits for Temperature-Conditional GFlowNetscited by 27
- 2023PhyloGFN: Phylogenetic inference with generative flow networkscited by 22
- 2021Autoregressive neural-network wavefunctions for ab initio quantum chemistrycited by 21
- 2020Combinatorial Black-Box Optimization with Expert Advicecited by 8
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.