Hyperuniform Delone Realizations and Rigidity
arXiv:2608.16547
2026
Training
1 ideas extracted · analyzed Sep 1, 2026
What the math gives to ML
The paper provides a realization theorem showing that arbitrary ergodic measurable R^d dynamics can be encoded by a Delone point process with arbitrarily strong finite-order suppression of low-frequency fluctuations, while retaining the original measurable dynamics. The transferable mechanism is hyperuniform sampling: enforce a structure factor that vanishes as the wave number approaches zero, thereby reducing long-wavelength sampling noise and count fluctuations. A practical neural-network adaptation is to replace iid collocation or minibatch locations by bounded-displacement, hyperuniform point sets and test whether smooth-loss integration and gradient estimates exhibit the predicted variance reduction. The theorem is not an explicit neural sampler, so implementation should use lattice-jitter, blue-noise, or Fourier-relaxation approximations and treat the low-frequency scaling law as the falsifiable target.
Ideas from this paper
Unverified
2026
Use spatially correlated training points whose low-frequency structure factor vanishes instead of iid points. For neural fields, PINNs, image-coordinate MLPs, or spatially indexed minibatches, this should suppress long-wavelength quadrature and gradient-estimation noise while preserving the represented target dynamics. The finite-order prediction is that a design with structure factor S(k)=O(|k|^{2q}) produces lower variance for smooth losses than iid sampling, especially as the domain or batch…
Useful5/10
Difficulty5/10
Novelty6/10