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

推荐订阅源

H
Help Net Security
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
博客园 - 【当耐特】
Microsoft Azure Blog
Microsoft Azure Blog
Google DeepMind News
Google DeepMind News
Apple Machine Learning Research
Apple Machine Learning Research
有赞技术团队
有赞技术团队
Y
Y Combinator Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
爱范儿
爱范儿
L
LangChain Blog
IT之家
IT之家
酷 壳 – CoolShell
酷 壳 – CoolShell
MongoDB | Blog
MongoDB | Blog
Hugging Face - Blog
Hugging Face - Blog
G
Google Developers Blog
T
Tailwind CSS Blog
Engineering at Meta
Engineering at Meta
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
宝玉的分享
宝玉的分享
博客园 - 三生石上(FineUI控件)
D
DataBreaches.Net
Recent Announcements
Recent Announcements
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More

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
Generic MANOVA limit theorems for products of projections
Dmitriy Kunisky · 2023-01-24 · via cs.IT updates on arXiv.org

We study the convergence of the empirical spectral distribution of $\mathbf{A} \mathbf{B} \mathbf{A}$ for $N \times N$ orthogonal projection matrices $\mathbf{A}$ and $\mathbf{B}$, where $\frac{1}{N}\mathrm{Tr}(\mathbf{A})$ and $\frac{1}{N}\mathrm{Tr}(\mathbf{B})$ converge as $N \to \infty$, to Wachter's MANOVA law. Using free probability, we show mild sufficient conditions for convergence in moments and in probability, and use this to prove a conjecture of Haikin, Zamir, and Gavish (2017) on random subsets of unit-norm tight frames. This result generalizes previous ones of Farrell (2011) and Magsino, Mixon, and Parshall (2021). We also derive an explicit recursion for the difference between the empirical moments $\frac{1}{N}\mathrm{Tr}((\mathbf{A} \mathbf{B} \mathbf{A})^k)$ and the limiting MANOVA moments, and use this to prove a sufficient condition for convergence in probability of the largest eigenvalue of $\mathbf{A} \mathbf{B} \mathbf{A}$ to the right edge of the support of the limiting law in the special case where that law belongs to the Kesten-McKay family. As an application, we give a new proof of convergence in probability of the largest eigenvalue when $\mathbf{B}$ is unitarily invariant; equivalently, this determines the limiting operator norm of a rectangular submatrix of size $\frac{1}{2}N \times αN$ of a Haar-distributed $N \times N$ unitary matrix for any $α\in (0, 1)$. Unlike previous proofs, we use only moment calculations and non-asymptotic bounds on the unitary Weingarten function, which we believe should pave the way to analyzing the largest eigenvalue for products of random projections having other distributions.