activity
20142025
most citedRecursive Sampling for the Nyström Method

93 citations · 426 across the 43 of their papers we have counts for

collaborators
Showing 2021Show all

7 papers · 1 filter

cs.LG2021

Active Linear Regression for Norms and Beyond

Cameron Musco, Christopher Musco, David P. Woodruff +1

We study active sampling algorithms for linear regression, which aim to query only a few entries of a target vector and output a near minimizer to $\min_{x\in\mat…

cs.DS2021

Dynamic Trace Estimation

Prathamesh Dharangutte, Christopher Musco

We study a dynamic version of the implicit trace estimation problem. Given access to an oracle for computing matrix-vector multiplications with a dynamically changing matrix A, our…

cs.SI2021★ 1 cited

How to Quantify Polarization in Models of Opinion Dynamics

Christopher Musco, Indu Ramesh, Johan Ugander +1

It is widely believed that society is becoming increasingly polarized around important issues, a dynamic that does not align with common mathematical models of opinion formation in…

math.NA2021★ 11 cited

Error bounds for Lanczos-based matrix function approximation

Tyler Chen, Anne Greenbaum, Cameron Musco +1

We analyze the Lanczos method for matrix function approximation (Lanczos-FA), an iterative algorithm for computing when is a Hermitian matri…

cs.DB2021★ 45 cited

Correlation Sketches for Approximate Join-Correlation Queries

Aécio Santos, Aline Bessa, Fernando Chirigati +2

The increasing availability of structured datasets, from Web tables and open-data portals to enterprise data, opens up opportunities~to enrich analytics and improve machine learnin…

cs.DB2021★ 21 cited

Public Transport Planning: When Transit Network Connectivity Meets Commuting Demand

Sheng Wang, Yuan Sun, Christopher Musco +1

In this paper, we make a first attempt to incorporate both commuting demand and transit network connectivity in bus route planning (CT-Bus), and formulate it as a constrained optim…

cs.DS2021★ 10 cited

Sublinear Time Spectral Density Estimation

Vladimir Braverman, Aditya Krishnan, Christopher Musco

We present a new sublinear time algorithm for approximating the spectral density (eigenvalue distribution) of an normalized graph adjacency or Laplacian matrix. The alg…