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

推荐订阅源

Y
Y Combinator Blog
V
V2EX
Jina AI
Jina AI
爱范儿
爱范儿
M
MIT News - Artificial intelligence
量子位
L
LangChain Blog
Google DeepMind News
Google DeepMind News
酷 壳 – CoolShell
酷 壳 – CoolShell
罗磊的独立博客
腾讯CDC
MongoDB | Blog
MongoDB | Blog
P
Proofpoint News Feed
宝玉的分享
宝玉的分享
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Last Week in AI
Last Week in AI
H
Hackread – Cybersecurity News, Data Breaches, AI and More
F
Fortinet All Blogs
The GitHub Blog
The GitHub Blog
Engineering at Meta
Engineering at Meta
博客园 - 聂微东
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
Vercel News
Vercel News
T
The Blog of Author Tim Ferriss

cs.IT updates on arXiv.org

Theoretical Limits of Language Model Alignment $f$-Divergence Regularized RLHF: Two Tales of Sampling and Unified Analyses A Unified Measure-Theoretic View of Diffusion, Score-Based, and Flow Matching Generative Models When Can Voting Help, Hurt, or Change Course? Exact Structure of Binary Test-Time Aggregation When Semantic Communication Meets Queueing: Cross-Layer Latency and Task Fidelity Optimization Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation Conditional Diffusion Under Linear Constraints: Langevin Mixing and Information-Theoretic Guarantees Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Expert Routing for Communication-Efficient MoE via Finite Expert Banks Contextual Memory-Enhanced Source Coding for Low-SNR Communications Realizable Bayes-Consistency for General Metric Losses Leveraging Code Automorphisms for Improved Syndrome-Based Neural Decoding A Hierarchical Sampling Framework for bounding the Generalization Error of Federated Learning Dueling DDQN-Based Adaptive Multi-Objective Handover Optimization for LEO Satellite Networks The Causal Description Gap: Information-Theoretic Separations Across Pearl's Hierarchy Optimization of CV-QKD Under Practical Constraints Benchmarking Wireless Representations: High-Dimensional vs. Compressed Embeddings for Efficiency and Robustness Real-Time Text Transmission via LLM-Based Entropy Coding over Fixed-Rate Channels SwiftChannel: Algorithm-Hardware Co-Design for Deep Learning-Based 5G Channel Estimation Evolving Token Communication with Parametric Memory Network Remote Action Generation: Remote Control with Minimal Communication The (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions Stabilizing Private LASSO under Heterogeneous Covariates via Anisotropic Objective Perturbation Linear-Readout Floors and Threshold Recovery in Computation in Superposition Soft Graph Diffusion Transformer for MIMO Detection Hierarchical Federated Learning for Networked AI: From Communication Saving to Architecture-Aware Design Exponential families from a single KL identity MIFair: A Mutual-Information Framework for Intersectionality and Multiclass Fairness Diffusion-OAMP for Joint Image Compression and Wireless Transmission Decoupled Descent: Exact Test Error Tracking Via Approximate Message Passing
Refining Concentration for Gaussian Quadratic Chaos with ...
[Submitted on 4 Dec 2024 (v1), last revised 1 Jul 2026 (this ver · 2024-12-05 · via cs.IT 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)