93 citations · 388 across the 44 of their papers we have counts for
5 papers · 1 filter
Minimizing Polarization and Disagreement in Social Networks
Cameron Musco, Christopher Musco, Charalampos E. Tsourakakis
The rise of social media and online social networks has been a disruptive force in society. Opinions are increasingly shaped by interactions on online social media, and social phen…
Is Input Sparsity Time Possible for Kernel Low-Rank Approximation?
Cameron Musco, David P. Woodruff
Low-rank approximation is a common tool used to accelerate kernel methods: the kernel matrix is approximated via a rank- matrix which can be stored i…
Stability of the Lanczos Method for Matrix Function Approximation
Cameron Musco, Christopher Musco, Aaron Sidford
The ubiquitous Lanczos method can approximate for any symmetric matrix , vector , and function . In exact arithmetic, the method's error after ite…
Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness
Cameron Musco, Praneeth Netrapalli, Aaron Sidford +2
Understanding the singular value spectrum of a matrix is a fundamental task in countless applications. In matrix multiplication time, it is possible…
Sublinear Time Low-Rank Approximation of Positive Semidefinite Matrices
Cameron Musco, David P. Woodruff
We show how to compute a relative-error low-rank approximation to any positive semidefinite (PSD) matrix in sublinear time, i.e., for any PSD matrix , in $\tilde O(…