activity
20142026
most citedRecursive Sampling for the Nyström Method

93 citations · 388 across the 44 of their papers we have counts for

collaborators
Showing 2018Show all

5 papers · 1 filter

cs.DS2018

A Universal Sampling Method for Reconstructing Signals with Simple Fourier Transforms

Haim Avron, Michael Kapralov, Cameron Musco +3

Reconstructing continuous signals from a small number of discrete samples is a fundamental problem across science and engineering. In practice, we are often interested in signals w…

cs.LG2018★ 82 cited

Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guarantees

Haim Avron, Michael Kapralov, Cameron Musco +3

Random Fourier features is one of the most popular techniques for scaling up kernel methods, such as kernel ridge regression. However, despite impressive empirical results, the sta…

cs.DS2018★ 1 cited

Near Optimal Linear Algebra in the Online and Sliding Window Models

Vladimir Braverman, Petros Drineas, Cameron Musco +4

We initiate the study of numerical linear algebra in the sliding window model, where only the most recent updates in a stream form the underlying data set. We first introduce a…

cs.DC2018★ 7 cited

Eigenvector Computation and Community Detection in Asynchronous Gossip Models

Frederik Mallmann-Trenn, Cameron Musco, Christopher Musco

We give a simple distributed algorithm for computing adjacency matrix eigenvectors for the communication graph in an asynchronous gossip model. We show how to use this algorithm to…

cs.SI2018★ 3 cited

Learning Networks from Random Walk-Based Node Similarities

Jeremy G. Hoskins, Cameron Musco, Christopher Musco +1

Digital presence in the world of online social media entails significant privacy risks. In this work we consider a privacy threat to a social network in which an attacker has acces…