Simultaneous Pointwise Majorization for Mixed Tail Processes with Applications in Gaussian Chaos and Ergodic Diffusions

• URL: http://arxiv.org/abs/2609.01576v2
• Date: Thu, 03 Sep 2026 20:09:44 GMT
• Title: Simultaneous Pointwise Majorization for Mixed Tail Processes with Applications in Gaussian Chaos and Ergodic Diffusions
• Abstract summary: Classical chaining controls an indexed process through a single worst-case bound.<n>We develop the first simultaneous pointwise majorization theory for Banach-valued processes.
• Score: 15.386375612838371
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Classical chaining controls an indexed stochastic process through a single worst-case bound and can therefore obscure substantial variation across the index set. We develop the first simultaneous pointwise majorization theory for Banach-valued processes with finite-metric mixed-tail increments. Suppose that an anchored process $(Z_t)_{t\in T}$ satisfies, for some integer $m\ge1$, pseudo-metrics $d_1,\ldots,d_m$, and orders $α_1,\ldots,α_m>0$, \begin{align*} \mathbb{P}\{\|Z_t-Z_s\|>\sum_{j=1}^m u^{1/α_j}d_j(s,t)\}\le 2e^{-u},s,t\in T. \end{align*} For ambient priors $μ_1,\ldots,μ_m$, let $v_j(t):=d_j(t,t_0), Φ_j(t):=\int_0^{4v_j(t)}(\log\frac{1}{μ_j(B_{d_j}(t,r))})^{1/α_j}dr$. We prove that, $\forall δ\in(0,1)$, with probability at least $1-δ$, simultaneously for all $t\in T$, \begin{align*} \|Z_t\|\le C_{m,\boldsymbolα}\sum_{j=1}^m\{Φ_j(t)+v_j(t)(\log(e/δ))^{1/α_j}\}. \end{align*} Here $\boldsymbolα:=(α_1,\ldots,α_m)$ and $C_{m,\boldsymbolα}$ depend only on $m$ and these tail orders. The result subsumes single-metric sub-Weibull processes of every positive order as the case $m=1$. In the Gaussian setting, it sharpens the pointwise upper bound of \citet{xu2026} by eliminating the logarithmic terms generated by dyadic peeling. The proof retains the index-wise costs of measure-generated admissible chains and synchronizes the regimes through a nested common refinement. Finally, we apply our theorems to stationary diffusion empirical processes and decoupled Gaussian chaos to obtain simultaneous pointwise envelope bounds, which can further be applied to other statistics problems.

Related papers

• Sharp Minimax Regret for Infinite-Memory Logistic Prediction [55.29259818039367]
  Lag $j$ can affect prediction by scale $r_j$ and enters only $n_T,j=T-j+1$ prediction rounds.<n>For every summable envelope, a localized mixture proves $cR_T(r)leq C_T(r)$.<n>For exponential and envelopes, under the stated finite-sample condition, a Toeplitz-design converse proves $cR_T(r)geq c_T(r)$.
  arXiv  Detail & Related papers  (2026-08-27T01:31:46Z)
• True Self-Avoiding Walk for Accelerating Markov-Chain Monte Carlo Integration [9.734388236956597]
  TSAW is a mechanism for improving empirical integral estimation via Markov chain Monte Carlo.<n>We consider finite-state adaptive sampling dynamics associated with an irreducible Markov kernel $P$ on a finite set.<n>For every bounded function $f:Vtomathbb R$, the error of our integral estimator converges as [ left|frac1tsum_s=0t-1 f(X_s)-sum_iin V_i f(i)right| = Oleft(fracsqrt
  arXiv  Detail & Related papers  (2026-05-28T20:09:36Z)
• Optimal Scalar Quantization for Matrix Multiplication: Closed-Form Density and Phase Transition [50.36362492608702]
  We study entrywise scalar quantization of two matrices prior to multiplication.<n>We obtain a closed-form optimal point density [ star(u) propto exp!left(-fracu26right)bigl( (1-2)+2u22bigr), qquad u=fracx_X,, and prove a correlation-driven phase transition.
  arXiv  Detail & Related papers  (2026-03-20T01:53:44Z)
• Spectral Gaps with Quantum Counting Queries and Oblivious State Preparation [47.600794349481966]
  In this work, we present a quantum algorithm which approximates values up to additive error $epsilonDelta_k$ using a logarithmic number of qubits.<n>A key technical step in the analysis is the preparation of a suitable random initial state, which ultimately allows us to efficiently count the number of eigenvalues that are smaller than a threshold.
  arXiv  Detail & Related papers  (2025-08-28T17:04:18Z)
• Improved sampling algorithms and Poincaré inequalities for non-log-concave distributions [2.959331374750817]
  We show that the query complexity of sampling from $mu$ can be $mathrmpoly(L,d)cdot left(fracLMdepsilon2right)mathcalO(L+1)$, which is in $d$ and $frac1epsilon$ when $L=mathcalO(1)$ and $M=mathrmpoly(d)$.
  arXiv  Detail & Related papers  (2025-07-15T12:06:11Z)
• Estimating the Mixing Coefficients of Geometrically Ergodic Markov Processes [5.00389879175348]
  We estimate the individual $beta$-mixing coefficients of a real-valued geometrically ergodic Markov process from a single sample-path. Naturally no density assumptions are required in this setting; the expected error rate is shown to be of order $mathcal O(log(n) n-1/2)$.
  arXiv  Detail & Related papers  (2024-02-11T20:17:10Z)
• On the $O(\frac{\sqrt{d}}{T^{1/4}})$ Convergence Rate of RMSProp and Its Momentum Extension Measured by $\ell_1$ Norm [54.28350823319057]
  This paper considers the RMSProp and its momentum extension and establishes the convergence rate of $frac1Tsum_k=1T.<n>Our convergence rate matches the lower bound with respect to all the coefficients except the dimension $d$.<n>Our convergence rate can be considered to be analogous to the $frac1Tsum_k=1T.
  arXiv  Detail & Related papers  (2024-02-01T07:21:32Z)
• On the Complexity of Decentralized Smooth Nonconvex Finite-Sum Optimization [21.334985032433778]
  Decentralized optimization problem $min_bf xinmathbb Rd f(bf x)triq frac1msum_i=1m f_i(bf x)triq frac1nsum_j=1n.
  arXiv  Detail & Related papers  (2022-10-25T11:37:11Z)
• Classical shadows of fermions with particle number symmetry [0.0]
  We provide an estimator for any $k$-RDM with $mathcalO(k2eta)$ classical complexity. Our method, in the worst-case of half-filling, still provides a factor of $4k$ advantage in sample complexity.
  arXiv  Detail & Related papers  (2022-08-18T17:11:12Z)
• Finite-time High-probability Bounds for Polyak-Ruppert Averaged Iterates of Linear Stochastic Approximation [22.51165277694864]
  This paper provides a finite-time analysis of linear approximation (LSA) algorithms with fixed step size. LSA is used to compute approximate solutions of a $d$-dimensional linear system.
  arXiv  Detail & Related papers  (2022-07-10T14:36:04Z)
• Statistical Inference of Constrained Stochastic Optimization via Sketched Sequential Quadratic Programming [53.63469275932989]
  We consider online statistical inference of constrained nonlinear optimization problems.<n>We apply the Sequential Quadratic Programming (StoSQP) method to solve these problems.
  arXiv  Detail & Related papers  (2022-05-27T00:34:03Z)
• Computational Complexity of Normalizing Constants for the Product of Determinantal Point Processes [12.640283469603357]
  We study the computational complexity of computing the normalizing constant. We show that $sum_Sdet(bf A_S,S)p$ exactly for every (fixed) positive even integer $p$ is UP-hard and Mod$_3$P-hard.
  arXiv  Detail & Related papers  (2021-11-28T14:08:25Z)
• On the Self-Penalization Phenomenon in Feature Selection [69.16452769334367]
  We describe an implicit sparsity-inducing mechanism based on over a family of kernels. As an application, we use this sparsity-inducing mechanism to build algorithms consistent for feature selection.
  arXiv  Detail & Related papers  (2021-10-12T09:36:41Z)
• Random matrices in service of ML footprint: ternary random features with no performance loss [55.30329197651178]
  We show that the eigenspectrum of $bf K$ is independent of the distribution of the i.i.d. entries of $bf w$. We propose a novel random technique, called Ternary Random Feature (TRF) The computation of the proposed random features requires no multiplication and a factor of $b$ less bits for storage compared to classical random features.
  arXiv  Detail & Related papers  (2021-10-05T09:33:49Z)
• On the Complexity of Minimizing Convex Finite Sums Without Using the Indices of the Individual Functions [62.01594253618911]
  We exploit the finite noise structure of finite sums to derive a matching $O(n2)$-upper bound under the global oracle model. Following a similar approach, we propose a novel adaptation of SVRG which is both emphcompatible with oracles, and achieves complexity bounds of $tildeO(n2+nsqrtL/mu)log (1/epsilon)$ and $O(nsqrtL/epsilon)$, for $mu>0$ and $mu=0$
  arXiv  Detail & Related papers  (2020-02-09T03:39:46Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.