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

推荐订阅源

aimingoo的专栏
aimingoo的专栏
Jina AI
Jina AI
WordPress大学
WordPress大学
Recent Announcements
Recent Announcements
G
Google Developers Blog
I
InfoQ
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Google DeepMind News
Google DeepMind News
P
Proofpoint News Feed
MyScale Blog
MyScale Blog
M
MIT News - Artificial intelligence
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
C
Check Point Blog
J
Java Code Geeks
T
Tailwind CSS Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Microsoft Security Blog
Microsoft Security Blog
MongoDB | Blog
MongoDB | Blog
V
Visual Studio Blog
人人都是产品经理
人人都是产品经理
量子位
A
About on SuperTechFans
D
DataBreaches.Net
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知

math.ST updates on arXiv.org

What is Learnable in Valiant's Theory of the Learnable? Learning Perturbations to Extrapolate Your LLM Byzantine-Robust Distributed Sparse Learning Revisited The Sample Complexity of Multiple Change Point Identification under Bandit Feedback A proximal gradient algorithm for composite log-concave sampling Model-based Bootstrap of Controlled Markov Chains Approximation of Maximally Monotone Operators : A Graph Convergence Perspective Posterior Contraction Rates for Sparse Kolmogorov-Arnold Networks in Anisotropic Besov Spaces MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound A Spectral Framework for Closed-Form Relative Density Estimation Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability Higher-Order Equilibrium Tracking for EM-Compressible Online Estimation Scaling Limits of Long-Context Transformers A Note on Non-Negative $L_1$-Approximating Polynomials Susceptibilities and Patterning: A Primer on Linear Response in Bayesian Learning Linear Response Estimators for Singular Statistical Models Statistical inference with belief functions: A survey Robust stochastic first order methods in heavy-tailed noise via medoid mini-batch gradient sampling Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity Adaptive auditing of AI systems with anytime-valid guarantees Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions Risk-Controlled Post-Processing of Decision Policies Covariate Balancing and Riesz Regression Should Be Guided by the Neyman Orthogonal Score in Debiased Machine Learning A Unified Pair-GRPO Family: From Implicit to Explicit Preference Constraints for Stable and General RL Alignment Time-Inhomogeneous Preconditioned Langevin Dynamics A Fine-Grained Understanding of Uniform Convergence for Halfspaces CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency Ratio-based Loss Functions Optimal Confidence Band for Kernel Gradient Flow Estimator A renormalization-group inspired lattice-based framework for piecewise generalized linear models
Sample canonical correlation coefficients of high-dimensi...
Fan Yang · 2020-02-22 · via math.ST updates on arXiv.org

Consider two random vectors $\mathbf C_1^{1/2}\mathbf x \in \mathbb R^p$ and $\mathbf C_2^{1/2}\mathbf y\in \mathbb R^q$, where the entries of $\mathbf x$ and $\mathbf y$ are i.i.d. random variables with mean zero and variance one, and $\mathbf C_1$ and $\mathbf C_2$ are $p \times p$ and $q\times q$ deterministic population covariance matrices. With $n$ independent samples of $(\mathbf C_1^{1/2}\mathbf x,\mathbf C_2^{1/2}\mathbf y)$, we study the sample correlation between these two vectors using canonical correlation analysis. We denote by $S_{xx}$ and $S_{yy}$ the sample covariance matrices for $\mathbf C_1^{1/2}\mathbf x$ and $\mathbf C_2^{1/2}\mathbf y$, respectively, and $S_{xy}$ the sample cross-covariance matrix. Then the sample canonical correlation coefficients are the square roots of the eigenvalues of the sample canonical correlation matrix $\cal C_{XY}:=S_{xx}^{-1}S_{xy}S_{yy}^{-1}S_{yx}$. Under the high-dimensional setting with ${p}/{n}\to c_1 \in (0, 1)$ and ${q}/{n}\to c_2 \in (0, 1-c_1)$ as $n\to \infty$, we prove that the largest eigenvalue of $\mathcal C_{XY}$ converges to the Tracy-Widom distribution as long as we have $\lim_{s \rightarrow \infty}s^4 [\mathbb{P}(\vert x_{ij} \vert \geq s)+ \mathbb{P}(\vert y_{ij} \vert \geq s)]=0$. This extends the result in [16], which established the Tracy-Widom limit of the largest eigenvalue of $\mathcal C_{XY}$ under the assumption that all moments are finite. Our proof is based on a linearization method, which reduces the problem to the study of a $(p+q+2n)\times (p+q+2n)$ random matrix $H$. In particular, we shall prove an optimal local law on its inverse $G:=H^{-1}$, i.e the resolvent. This local law is the main tool for both the proof of the Tracy-Widom law in this paper, and the study in [22,23] on the canonical correlation coefficients of high-dimensional random vectors with finite rank correlations.