76 citations · 357 across the 44 of their papers we have counts for
5 papers · 1 filter
Streaming PCA: averaging from a geometric perspective
Tuan Pham, Alessandro Rinaldo, Purnamrita Sarkar
We study principal component analysis (PCA) under memory constraints, a setting that is increasingly important in large-scale data analysis. Our focus is on Oja's algorithm, which…
Trading off Accuracy for Speedup: Multiplier Bootstraps for Subgraph Counts
Qiaohui Lin, Robert Lunde, Purnamrita Sarkar
We propose a new class of multiplier bootstraps for count functionals, ranging from a fast, approximate linear bootstrap tailored to sparse, massive graphs to a quadratic bootstrap…
Hierarchical community detection by recursive partitioning
Tianxi Li, Lihua Lei, Sharmodeep Bhattacharyya +4
The problem of community detection in networks is usually formulated as finding a single partition of the network into some "correct" number of communities. We argue that it is mor…
Covariate Regularized Community Detection in Sparse Graphs
Bowei Yan, Purnamrita Sarkar
In this paper, we investigate community detection in networks in the presence of node covariates. In many instances, covariates and networks individually only give a partial view o…
A Scalable Bootstrap for Massive Data
Ariel Kleiner, Ameet Talwalkar, Purnamrita Sarkar +1
The bootstrap provides a simple and powerful means of assessing the quality of estimators. However, in settings involving large datasets---which are increasingly prevalent---the co…