A central limit theorem for scaled eigenvectors of random dot product graphs

2013-05-31 · Avanti Athreya, Vince Lyzinski, David J. Marchette, Carey E. Priebe, Daniel L. Sussman, Minh Tang

We prove a central limit theorem for the components of the largest eigenvectors of the adjacency matrix of a finite-dimensional random dot product graph whose true latent positions are unknown. In particular, we follow the methodology outlined in \citet{sussman2012universally} to construct consistent estimates for the latent positions, and we show that the appropriately scaled differences between the estimated and true latent positions converge to a mixture of Gaussian random variables. As a corollary, we obtain a central limit theorem for the first eigenvector of the adjacency matrix of an Erd\"os-Renyi random graph.

📄 PDF Abstract BibTeX arXiv:1305.7388

Code (0)

등록된 구현이 없습니다.

Limit theorems for eigenvectors of the normalized Laplacian for random graphs

2016-07-28 · Minh Tang, Carey E. Priebe

We prove a central limit theorem for the components of the eigenvectors corresponding to the $d$ largest eigenvalues of the normalized Laplacian matrix of a finite dimensional random dot product graph. As a corollary, we…

Functional Central Limit Theorem for Stochastic Gradient Descent

2026-02-17 · Kessang Flamand, Victor-Emmanuel Brunel arxiv

We study the asymptotic shape of the trajectory of the stochastic gradient descent algorithm applied to a convex objective function. Under mild regularity assumptions, we prove a functional central limit theorem for the …

A functional central limit theorem for kernel gradient flow and infinitesimal gradient boosting

2026-06-24 · Clément Dombry, Jean-Jil Duchamps arxiv

Building on the large-sample analysis of infinitesimal gradient boosting (Dombry and Duchamps, 2024b), we study the fluctuations of the process around its deterministic limit and establish a functional central limit theo…

A scaled Bregman theorem with applications

2016-07-01 · NeurIPS 2016 12 · Richard Nock, Aditya Krishna Menon, Cheng Soon Ong

Bregman divergences play a central role in the design and analysis of a range of machine learning algorithms. This paper explores the use of Bregman divergences to establish reductions between such algorithms and their a…

BIG-bench Machine Learning Clustering

Statistical Estimation and Inference via Local SGD in Federated Learning

2021-09-03 · Xiang Li, Jiadong Liang, Xiangyu Chang, Zhihua Zhang

Federated Learning (FL) makes a large amount of edge computing devices (e.g., mobile phones) jointly learn a global model without data sharing. In FL, data are generated in a decentralized manner with high heterogeneity.…

Edge-computing Federated Learning