mlsanityData to 7 Oct 2026

Flow-based Extremal Mathematical Structure Discovery

arXiv 2601.18005 ↗First posted 25 Jan 2026math.CO cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

The discovery of extremal structures in mathematics requires navigating vast and nonconvex landscapes where analytical methods offer little guidance and brute-force search becomes intractable. We introduce FlowBoost, a closed-loop generative framework that learns to discover rare and extremal geometric structures by combining three components: (i) a geometry-aware conditional flow-matching model that learns to sample high-quality configurations, (ii) reward-guided policy optimization with action exploration that directly optimizes the generation process toward the objective while maintaining diversity, and (iii) stochastic local search for both training-data generation and final refinement. Unlike prior open-loop approaches, such as PatternBoost that retrains on filtered discrete samples, or AlphaEvolve which relies on frozen Large Language Models (LLMs) as evolutionary mutation operators, FlowBoost enforces geometric feasibility during sampling, and propagates reward signal directly into the generative model, closing the optimization loop and requiring much smaller training sets and shorter training times, and reducing the required outer-loop iterations by orders of magnitude, while eliminating dependence on LLMs. We demonstrate the framework on four geometric optimization problems: sphere packing in hypercubes, circle packing maximizing sum of radii, the Heilbronn triangle problem, and star discrepancy minimization. In several cases, FlowBoost discovers configurations that match or exceed the best known results. For circle packings, we improve the best known lower bounds, surpassing the LLM-based system AlphaEvolve while using substantially fewer computational resources.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 51 of its 74 references that are in the map. First posted on arXiv 25 Jan 2026.

Builds on

51 of 74 references.

References · 51

  1. 2017Attention Is All You Needcited by 59,932
  2. 2020Denoising Diffusion Probabilistic Modelscited by 20,851
  3. 2017Proximal Policy Optimization Algorithmscited by 14,441
  4. 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,893
  5. 2022Generative Adversarial Networkscited by 5,603
  6. 2022Flow Matching for Generative Modelingcited by 5,426
  7. 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
  8. 2024Scaling Rectified Flow Transformers for High-Resolution Image Synthesiscited by 4,094
  9. 2017Deep reinforcement learning from human preferencescited by 3,846
  10. 2015Trust Region Policy Optimizationcited by 2,503
  11. 2017FiLM: Visual Reasoning with a General Conditioning Layercited by 2,286
  12. 2015Variational Inference with Normalizing Flowscited by 2,161
38 more
  1. 2020GLU Variants Improve Transformercited by 1,724
  2. 2019Root Mean Square Layer Normalizationcited by 1,425
  3. 2018Relational inductive biases, deep learning, and graph networkscited by 1,341
  4. 2025AlphaEvolve: A coding agent for scientific and algorithmic discoverycited by 763
  5. 2019Advantage-Weighted Regression: Simple and Scalable Off-Policy Reinforcement Learningcited by 750
  6. 2020AWAC: Accelerating Online Reinforcement Learning with Offline Datasetscited by 647
  7. 2020When and why PINNs fail to train: A neural tangent kernel perspectivecited by 629
  8. 2019The frontier of simulation-based inferencecited by 490
  9. 2021Flow Network based Generative Models for Non-Iterative Diverse Candidate Generationcited by 384
  10. 2021Understanding Dimensional Collapse in Contrastive Self-supervised Learningcited by 374
  11. 2023Flow Matching on General Geometriescited by 260
  12. 2023A Cookbook of Self-Supervised Learningcited by 248
  13. 2023ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematicscited by 180
  14. 2022Biological Sequence Design with GFlowNetscited by 172
  15. 2025ShinkaEvolve: Towards Open-Ended And Sample-Efficient Program Evolutioncited by 146
  16. 2024Formal Mathematical Reasoning: A New Frontier in AIcited by 80
  17. 2025Mathematical exploration and discovery at scalecited by 66
  18. 2021Constructions in combinatorics via neural networkscited by 46
  19. 2025Physics-Constrained Flow Matching: Sampling Generative Models with Hard Constraintscited by 46
  20. 2024Gradient-Free Generation for Hard-Constrained Systemscited by 35
  21. 2024PatternBoost: Constructions in Mathematics with a Little Help from AIcited by 32
  22. 2025Simulation-Based Inference: A Practical Guidecited by 30
  23. 2024Global Lyapunov functions: a long-standing open problem in mathematics, with symbolic transformerscited by 29
  24. 2017Simulation optimization: A review of algorithms and applicationscited by 22
  25. 2022Towards a Mathematics Formalisation Assistant using Large Language Modelscited by 22
  26. 2023Deep Generative Models for Detector Signature Simulation: A Taxonomic Reviewcited by 18
  27. 2022Murmurations of elliptic curvescited by 14
  28. 2023Searching for ribbons with machine learningcited by 11
  29. 2025IMProofBench: Benchmarking AI on Research-Level Mathematical Proof Generationcited by 11
  30. 2024What makes math problems hard for reinforcement learning: a case studycited by 9
  31. 2023Transition Path Sampling with Boltzmann Generator-based MCMC Movescited by 8
  32. 2024Can Transformers Do Enumerative Geometry?cited by 8
  33. 2024A Triumvirate of AI Driven Theoretical Discoverycited by 5
  34. 2025CayleyPy RL: Pathfinding and Reinforcement Learning on Cayley Graphscited by 5
  35. 2021Star Discrepancy Subset Selection: Problem Formulation and Efficient Approaches for Low Dimensionscited by 4
  36. 2025Energy-Based Flow Matching for Generating 3D Molecular Structurecited by 4
  37. 2023An ML approach to resolution of singularitiescited by 3
  38. 2023Machine learning assisted exploration for affine Deligne-Lusztig varietiescited by 3

50 most cited of 51 All 51 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 3.

3 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Max It or Miss It: Benchmarking LLM On Solving Extremal Problems
  2. 2026Particle Dynamics of Flow Matching and Classifier-Free Guidance from a Stagewise Geometry Perspective
  3. 2026Test-Time Scaling for Scientific Equation Discovery
  4. 2026Property-Guided Molecular Generation and Optimization via Latent Flows
  5. 2025Constraint-Aware Flow Matching via Randomized Exploration
  6. 2026Context-weighted Discrete Flow Matching
  7. 2025Flow Density Control: Generative Optimization Beyond Entropy-Regularized Fine-Tuning
  8. 2026Distribution-Aware Algorithm Design with LLM Agents