Spherical Cap L 2 Discrepancy -- Blessing of Dimensionality and a Distance-Kernel Variant
math.NA, cs.NA, math.NT
Submitted: 2026-04-23
Updated: 2026-11-05
License: http://creativecommons.org/licenses/by/4.0/
The gist: We prove a dimension-explicit upper bound for the information-complexity (also called the inverse of the discrepancy) of the classical spherical cap L 2 discrepancy on the d-dimensional sphere S d.
Terminology
Abstract
We prove a dimension-explicit upper bound for the information-complexity (also called the inverse of the discrepancy) of the classical spherical cap L 2 discrepancy on the d-dimensional sphere S d. For every fixed epsilon in(0,1), this bound implies that a single point suffices in all sufficiently large dimensions, which shows a ``blessing of dimensionality'' for the associated numerical integration problem. We then introduce a one-parameter family of distance reproducing kernels for the Sobolev space H(d+1)/2(S d). For the balanced kernel K(,)=1- sqrt 2 | - |, a lower bound together with a random-point upper bound shows that the normalized information-complexity is Θ epsilon(d) for every fixed epsilon in(0,1). Thus its dependence on d is determined up to constants depending only on epsilon. Finally, we study the one-sided spherical cap discrepancy obtained by restricting the height parameter to [0,1]. We derive its kernel and Stolarsky's invariance principle explicitly. A sharp mean-distance inequality, attained by regular simplices, determines its normalized information-complexity exactly in all sufficiently large dimensions and proves strong polynomial tractability with optimal epsilon-exponent two.
Sources
Related papers
- Do physics-informed neural networks (PINNs) need to be deep? Shallow PINNs using the Levenberg-Marquardt algorithm
- A Neural-preconditioned Poisson Solver for Mixed Dirichlet and Neumann Boundary Conditions
- Advanced Linear Algebra with Applications - Part I (Numerical linear algebra for PDEs, machine learning, and data assimilation)
- Operator learning meets inverse problems: A probabilistic perspective
- Second-order consistency for learning chaotic dynamics via randomized Jacobian matching
- Windowed thinning and query complexity for the bouncy particle and Zigzag samplers