惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

The GitHub Blog
The GitHub Blog
Martin Fowler
Martin Fowler
Vercel News
Vercel News
U
Unit 42
Engineering at Meta
Engineering at Meta
aimingoo的专栏
aimingoo的专栏
MyScale Blog
MyScale Blog
Y
Y Combinator Blog
阮一峰的网络日志
阮一峰的网络日志
爱范儿
爱范儿
Apple Machine Learning Research
Apple Machine Learning Research
博客园_首页
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
B
Blog RSS Feed
N
Netflix TechBlog - Medium
GbyAI
GbyAI
F
Fortinet All Blogs
MongoDB | Blog
MongoDB | Blog
大猫的无限游戏
大猫的无限游戏
C
Check Point Blog
M
MIT News - Artificial intelligence
D
Docker
IT之家
IT之家
Stack Overflow Blog
Stack Overflow Blog

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Refining Concentration for Gaussian Quadratic Chaos with ...
[Submitted on 4 Dec 2024 (v1), last revised 1 Jul 2026 (this ver · 2024-12-05 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:The paper studies concentration of measure for Gaussian quadratic chaos in the non-asymptotic regime where existing bounds are improved and new bounds are proposed. We begin by slightly tightening Hanson-Wright inequality (HWI) by increasing its absolute constant from the largest known value of 0.125 to at least 0.145 in the symmetric case. A sharper version of an inequality of Laurent and Massart (LMI) is presented. It results in an increase in the absolute constant in HWI from the largest available value of $1-\frac{\sqrt{3}}{2}$ due to LMI to $\frac{9-\sqrt{17}}{32}$ in the positive-semidefinite case. Moving beyond HWI, we develop a sequence of inequalities indexed by $m\ge1$ that involves Schatten norms of the underlying symmetric matrix. The case $m=1$ recovers HWI and the case $m=\infty$ leads to a novel bound called the $m_\infty$-bound. Avoiding Markov's inequality, we introduce the strong $\chi^2$-inequality and its loosened version, the weak $\chi^2$-inequality. To investigate the $m_\infty$-bound, we explore all concentration bounds that only involve the operator norm of the underlying positive-definite matrix. Five candidates are examined, namely, the $m_\infty$-bound, relaxed versions of HWI and LMI, the weak $\chi^2$-bound and the large deviations bound. The sharpest among these bounds is either the $m_\infty$-bound or the weak $\chi^2$-bound. If the matrix dimension is $n=2,4,6$, the weak $\chi^2$-bound is tighter than the $m_\infty$-bound. For even $n\ge8$, the $m_\infty$-bound is sharper than the weak $\chi^2$-bound if and only if the ratio of the tail parameter over the operator norm lies inside an open interval which expands indefinitely as $n$ grows. Modified versions of HW, $m_\infty$ and strong $\chi^2$ inequalities of various orders are proposed. Their effectiveness is demonstrated by two applications in signal detection for sonar and wireless communications.

Submission history

From: Kamyar Moshksar [view email]
[v1] Wed, 4 Dec 2024 23:35:59 UTC (575 KB)
[v2] Wed, 29 Jan 2025 04:48:24 UTC (878 KB)
[v3] Wed, 10 Dec 2025 04:12:16 UTC (741 KB)
[v4] Wed, 1 Jul 2026 23:15:06 UTC (1,466 KB)