mlsanityData to 14 Oct 2026

Message-Passing Monte Carlo: Generating low-discrepancy point sets via Graph Neural Networks

arXiv 2405.15059 ↗First posted 23 May 2024cs.LG cs.NA math.NAcited by 6

Not on the map. Why?

Abstract (arXiv)

Discrepancy is a well-known measure for the irregularity of the distribution of a point set. Point sets with small discrepancy are called low-discrepancy and are known to efficiently fill the space in a uniform manner. Low-discrepancy points play a central role in many problems in science and engineering, including numerical integration, computer vision, machine perception, computer graphics, machine learning, and simulation. In this work, we present the first machine learning approach to generate a new class of low-discrepancy point sets named Message-Passing Monte Carlo (MPMC) points. Motivated by the geometric nature of generating low-discrepancy point sets, we leverage tools from Geometric Deep Learning and base our model on Graph Neural Networks. We further provide an extension of our framework to higher dimensions, which flexibly allows the generation of custom-made points that emphasize the uniformity in specific dimensions that are primarily important for the particular problem at hand. Finally, we demonstrate that our proposed model achieves state-of-the-art performance superior to previous methods by a significant margin. In fact, MPMC points are empirically shown to be either optimal or near-optimal with respect to the discrepancy for low dimension and small number of points, i.e., for which the optimal discrepancy can be determined. Code for generating MPMC points can be found at https://github.com/tk-rusch/MPMC.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 19 of its 77 references that are in the map. First posted on arXiv 23 May 2024.

Builds on

19 of 77 references.

References · 19

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2017Graph Attention Networkscited by 8,923
  3. 2017Neural Message Passing for Quantum Chemistrycited by 3,487
  4. 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,089
  5. 2018Graph Neural Networks: A Review of Methods and Applicationscited by 1,576
  6. 2017Deep Setscited by 1,421
  7. 2021Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gaugescited by 1,167
  8. 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,138
  9. 2013Spectral Networks and Locally Connected Networks on Graphscited by 1,102
  10. 2016Geometric deep learning on graphs and manifolds using mixture model CNNscited by 468
  11. 2021ETA Prediction with Graph Neural Networks in Google Mapscited by 130
  12. 2020Enhancing accuracy of deep learning algorithms by training with low-discrepancy sequencescited by 20
7 more
  1. 2020Higher-order Quasi-Monte Carlo Training of Deep Neural Networkscited by 12
  2. 2019Fully Parallel Hyperparameter Search: Reshaped Space-Fillingcited by 5
  3. 2023Heuristic Approaches to Obtain Low-Discrepancy Point Sets via Subset Selectioncited by 5
  4. 2021Star Discrepancy Subset Selection: Problem Formulation and Efficient Approaches for Low Dimensionscited by 4
  5. 2023Computing Star Discrepancies with Numerical Black-Box Optimization Algorithmscited by 3
  6. 2023Constructing Optimal L∞ Star Discrepancy Setscited by 3
  7. 2013Constructing Low Star Discrepancy Point Sets with Genetic Algorithmscited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 5; 2026: 1.

6 papers.