We lifted 2 functions out of this paper's own repositories and ran 2 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| tk-rusch/mpmc | canonical | 2 of 2 |
| Function | Status | Where it lives |
|---|---|---|
| L2discrepancy | Ran | tk-rusch/mpmc/utils.py code served (permissive licence) · get_code("0a300709a1f8aa4d") |
| hickernell_all_emphasized | Ran | tk-rusch/mpmc/utils.py code served (permissive licence) · get_code("491541c9b1552f23") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2405.15059")
get_code_for_paper("2405.15059")
have("2405.15059")
Connect an agent — have() is free.