AI & ML
Sampling discretization of the uniform norm for hyperbolic-cross trigonometric polynomials
arXiv cs.NA0 views
arXiv:2610.07679v1 Announce Type: new Abstract: We study sampling discretization of the uniform norm for trigonometric polynomials with frequencies in a hyperbolic cross of level $N$ on $\T^d$. For every $d,N\ge2$ and $\varepsilon\in(0,1)$, we construct an explicit norming set with at most $\bigl(C_1(1+\varepsilon^{-1})\bigr)^{d-1}N^{1+\varepsilon}$ points and norming constant at most $\bigl(C_2(1+\varepsilon^{-1})\bigr)^{d-1}$, where $C_1,C_2$ are absolute constants. We also prove that independent Haar-distributed points achieve the same exponent $1+\varepsilon$: a sample of size at least $C(d,\varepsilon)N^{1+\varepsilon}\log(2/\eta)$ norms the entire space simultaneously with probability at least $1-\eta$, with a norming constant bounded by $\exp(C_d\varepsilon^{-d})$ and independent of $N$. The deterministic construction combines uniformly stable de la Vall\'ee Poussin sampling operators with a Smolyak-type combination identity. The random result follows from an abstract norming theorem for sums of spaces associated with commuting regular partitions, together with a multiscale approximation of hyperbolic-cross polynomials. Finally, we show that every norming set of constant $B>1$ for the trigonometric polynomials with frequencies in $\{-1,0,1\}^d$ has at least $\bigl(\pi d/(2e\log B)\bigr)^{d/2}$ points. This rules out quadratic bounds in the dimension of the polynomial space with a prefactor growing only polynomially in $d$ when the norming constant is fixed.
Source:https://arxiv.org/abs/2610.07679PreviousLow-rank SI-DSA and GMRES-DSA for Radiative Transfer Equation with Adaptive Accuracy ControlNextLearned Adaptive Multiresolution Diffusion Imaging
Related posts

Build World Models for Interactive Simulation with NVIDIA Cosmos
0NVIDIA Developer Blog
Seeing and Imagining as One: Unified Video Generation and 4D Perception for Embodied World Modeling
0arXiv cs.RO
Shared Modular Recurrence in Contextual MDPs for Universal Morphology Control
0arXiv cs.RO
BeeTalk 群主必备:AI 群管机器人 AIGB 免费解决垃圾信息问题
0dev.to AI
I Open-Sourced a Free YouTube Shorts Factory. The Money Isn't in the Shorts.
0dev.to AI
Priced per TB/s, the H200 beats the H100 at 6 of 7 providers
0dev.to Python