Comparison of probabilistic and deterministic point sets
Peter Grabner, Tetiana Stepanyuk

TL;DR
This paper compares probabilistic and deterministic point sets on spheres, showing that certain deterministic spherical t-designs perform as well as probabilistic sets in energy minimization, with asymptotic results for well-separated designs.
Contribution
It establishes asymptotic equalities for the Riesz s-energy of well-separated spherical t-designs and demonstrates their effectiveness compared to probabilistic point sets.
Findings
Deterministic spherical t-designs can match probabilistic sets in energy performance.
Asymptotic formulas for Riesz s-energy of well-separated t-designs are derived.
Existence of well-separated t-designs with N points proportional to t^d is confirmed.
Abstract
In this paper we make a comparison between certain probabilistic and deterministic point sets and show that some deterministic constructions (spherical -designs) are better or as good as probabilistic ones. We find asymptotic equalities for the discrete Riesz -energy of sequences of well separated -designs on the unit sphere , . The case was studied Hesse and Leopardi. Bondarenko, Radchenko, and Viazovska established, that for , there exists a constant , such that for every there exists a well-separated spherical -design on with points. For this reason, in our paper we assume, that the sequence of well separated spherical -designs is such that and are related by .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
