Noise-shaped one-bit coefficients in normalized discrete polynomial Fourier extension are studied, and exact orthogonality identities, fourth-moment formulas, local kernel estimates, and oscillatory transfer bounds are established.
Abstract
This report studies noise-shaped one-bit coefficients in normalized discrete polynomial Fourier extension. For first-order Sigma-Delta quantization, the error is written as $e_k=u_k-q_k=\Delta v_k$ with a uniformly bounded state. Discrete summation by parts then yields variation estimates for complex weights and an $O(N^{-1})$ approximation rate on compact parameter sets. For the parabolic phase $\phi_{x,t}(\xi)=x\xi+t\xi^2$, the bound is expressed through $J(x,t)=\int_0^1 |x+2t\xi|d\xi$, and the uniform $N^{-1}$ rate is shown to be sharp over the admissible input class. Higher-order finite-record identities are derived with all endpoint traces retained. Under endpoint compatibility, or after explicit boundary correction, an $r$th-order noise-shaped error $e=\Delta^r v$ gives $O(N^{-r})$ decay for sufficiently smooth weights and $O(N^{-(r-1+\alpha)})$ decay for $C^{r-1,\alpha}$ weights. Exact $L^2$ orthogonality identities, fourth-moment formulas, local kernel estimates, and oscillatory transfer bounds are also established. Extensions to polynomial phases, multidimensional parameter families, growing observation regions, and correlated state models are included.
This paper computes Poisson space noise functionals, $P^{\prime}(u)$, realised in a Gel'fand triple built from a L\'evy measure $\lambda_{\beta}(u)du$. We isolate three discretisation parameters: a small-amplitude cut-off, a Donsker delta truncation M, and a chaos order N. For a stable-type intensity $\lambda_{\beta}(u...
Exhaustive moment fitting in this constant-dimensional space produces a proper mixture and, together with the dimension-free moment characterization of Gaussian mixtures, achieves the optimal Hellinger rate in polynomial arithmetic time for every fixed $k$.
Let $M_n$ be an $n\times n$ matrix with independent uniform sign entries. We prove that there exist absolute constants $C,c>0$ such that, for all sufficiently large $n$, \[ \mathbb{P}\!\left( \left|\operatorname{Per}(M_n)\right| \ge e^{-Cn}\sqrt{n!} \right) \ge 1-n^{-c}. \] This establishes the exponential scale lower...
We study Toeplitz determinants $\det T_n(e^f)$ for $f$ whose Fourier coefficients satisfy $f_k=O(|k|^{-1})$. This regime extends beyond $H^{1/2}$ and includes symbols with Fisher-Hartwig singularities. We develop an operator-theoretic approach based on the Baker-Campbell-Hausdorff formula that separates the quadratic t...
A fully non-adaptive public-coin protocol that fixes every measurable 1-bit query before communication is constructed, and rates answer the Lau--Scarlett open problem for arbitrary measurable 1-bit queries in the affirmative.
A randomized fully non-adaptive protocol is constructed that fixes all queries before observing the data and matches the optimal adaptive sample complexity, giving a negative answer to the COLT 2026 open problem asking whether interaction is necessary for order-optimal one-bit mean estimation.
Jiachen Hu, Han Zhong· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.