Skip to content
Preprint

Tight Worst-Case Bounds for the Smallest Eigenvalue of ReLU NTK Gram Matrices

Aug 2026 · 1 citation · ⚡ 1 influential · 10 references
Computer Science

Abstract

For $n$ unit vectors $x_1,\ldots,x_n \in \mathbb{R}^d$, we study the continuous ReLU derivative Gram matrix $H$, whose entries are obtained by averaging pairwise gated inner products over a standard Gaussian direction. Writing $ \Delta_\pm := \min_{i \neq j} \min\{ \|x_i-x_j\|_2, \|x_i+x_j\|_2 \} $ for their projective separation, we prove the universal dimension-free lower bound $ \lambda_{\min}(H) = \Omega( \Delta_\pm/\sqrt{\log n} ) $. Conversely, we construct worst-case families satisfying the matching upper bound $ \lambda_{\min}(H) = O( \Delta_\pm/\sqrt{\log n} ) $, showing that this rate is tight up to universal constants.

View source

Similar papers

Preprint Aug 2026

Szeg\H{o}-type determinant asymptotics for generalized Hilbert matrices with edge eigenvalues

We compute the large-$N$ asymptotics of the determinant of the identity plus or minus a generalized Hilbert matrix. For $N \in \mathbb{N}$ and $\delta \in \mathbb{R} \setminus \{-1, -2, \ldots\}$, let \[ H_N^\delta := \left( \frac{\sin((1+\delta)\pi)}{\pi(j+k+1+\delta)} \right)_{j,k=0}^{N-1} \] be the generalized Hilbe...

Martin Gebert, Heinrich Küttler · 0 citations
Preprint Aug 2026

Sharp Convex Concentration for Symmetric Random Tensors with Subgaussian Coordinates

Let $X=(X_1,\ldots,X_n)$ have independent coordinates with mean zero, variance one, and $\|X_i\|_{\psi_2}\le K$, and let $H_d=(\mathbb R^n)^{\otimes_2 d}$. Let $L>0$ and let $f:H_d\to\mathbb R$ be convex and $L$-Lipschitz. We prove that, for $0\le t\le c_KLn^{d/2}$, \[ \textsf{P}\left\{ \left\lvert f(X^{\otimes d})-\te...

Xuan-Ang Hu · 0 citations
Preprint Oct 2026

Stable and Online Algorithms for Random Matrix Discrepancy

We study the average-case matrix discrepancy problem: given independent normalized $d\times d$ Gaussian orthogonal ensemble matrices $A_1,\dots,A_N$ and a fixed margin $\kappa>0$, find signs $\sigma_1,\dots,\sigma_N\in\{-1,1\}$ such that the operator norm of $\sum_{i=1}^N \sigma_i A_i$ is at most $\kappa\sqrt{N}$. Focu...

Eren C. Kızıldağ, Shuang-Ping Li · 0 citations
Preprint Sep 2026

The essential norm, block sizes, and some Generalized Hilbert operators on lp

We examine the generalized Hilbert (matrix) operators $$ H_{g,\gamma} : (a_n) \mapsto \sum_{n=1}^{\infty} \bigg(\frac{k}{n}\bigg)^{\gamma} \frac{g_k a_n}{n+k} $$ on the $\ell^p$ spaces, $1<p<\infty$, where $g=(g_n)$ is a sequence and $-1/p<\gamma<1-1/p$. Given a partition of the natural numbers $\bigcup_j I_j = \mathbb...

D. Norrbo · 0 citations
Preprint Sep 2026

Rank-One Matrix Discrepancy and Algorithmic Kadison--Singer

We give a deterministic polynomial-time algorithm that, given rational Hermitian matrices $H_1,\dots,H_N$ of rank at most one, finds signs $s\in\{\pm1\}^N$ with $\|\sum_i s_i H_i\|\le 13\|\sum_i H_i^2\|^{1/2}$. As a corollary, for vectors $v_i$ with $\sum_i v_iv_i^*=I$ and $\|v_i\|^2\le\delta$, the signs yield a partit...

Ekene Ezeunala, Hao-Tian Jiang · 2 citations · ⚡1
Preprint Sep 2026

The typical size of Hecke eigenvalue sums is $o(\sqrt{x})$

Let $\mathcal{H}_k$ denote the set of normalized holomorphic Hecke cusp forms of weight $k$ for the full modular group $ \mathrm{SL}_2(\mathbb Z)$. For each $f\in\mathcal{H}_k$, let $\lambda_f(n)$ denote the corresponding eigenvalue of the normalized Hecke operator $T_n$. We prove nontrivial upper bounds for \[\sum_{f...

Max Wenqiang Xu, Jun-Ren Zheng · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.