Christopher Musco
24 papers · 2015–2026 · 6 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+9 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (43) π Conference Polyglot Β· Silver π Academic Marathon Β· Half π Interdisciplinary Bridge Β· Gold π£ Hot Topic Early Bird
π
Grand Slam
π
Keyword Champion
(4)
π§
Keyword Pioneer
π€
Dynamic Duo
(10)
β‘
Prolific Year Β· Productive
π
Century Club Β· Bronze
π
Renaissance Researcher
(5)
ποΈ
Keyword Collector
(132)
π
Trend Setter
Top co-authors
Research topics
Machine Learning
(21)
Mathematics & Optimization
(15)
Core Methods
(14)
Optimization & Theory
(14)
Mathematics
(13)
Optimization
(11)
Computer Science
(6)
Foundations
(6)
Learning Types
(5)
Artificial Intelligence
(3)
Data Science & Analytics
(3)
Security & Privacy
(2)
Application Areas
(2)
Core AI
(2)
Methods
(2)
Keywords
active learning
(5)
leverage score sampling
(4)
matrix approximation
(4)
randomized algorithm
(3)
leverage score
(3)
differential privacy
(2)
dimensionality reduction
(2)
random fourier feature
(2)
agnostic learning
(2)
matrix sketching
(2)
random walk
(2)
graph learning
(2)
wasserstein distance
(2)
low-rank approximation
(2)
gaussian process regression
(2)
kernel approximation
(2)
sample complexity
(2)
principal component analysis
(2)
approximation algorithm
(2)
krylov subspace
(2)
Papers
Query Efficient Structured Matrix Learning
COLT 2026
Matrix Product Sketching via Coordinated Sampling
ICLR 2025
Provably Accurate Shapley Value Estimation via Leverage Score Sampling
ICLR 2025
Sharper Bounds for Chebyshev Moment Matching, with Applications
COLT 2025
Agnostic Active Learning of Single Index Models with Linear Sample Complexity
COLT 2024
A Simple and Practical Method for Reducing the Disparate Impact of Differential Privacy
AAAI 2024
Benchmarking Estimators for Natural Experiments: A Novel Dataset and a Doubly Robust Algorithm
NeurIPS 2024
Faster Spectral Density Estimation and Sparsification in the Nuclear Norm (Extended Abstract)
COLT 2024
Improved Active Learning via Dependent Leverage Score Sampling
ICLR 2024
Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits
NeurIPS 2024
Nearly Optimal Approximation of Matrix Functions by the Lanczos Method
NeurIPS 2024
Active Learning for Single Neuron Models with Lipschitz Non-Linearities
AISTATS 2023
Dimensionality Reduction for General KDE Mode Finding
ICML 2023
Moments, Random Walks, and Limits for Spectrum Approximation
COLT 2023
Structured Semidefinite Programming for Recovering Structured Preconditioners
NeurIPS 2023
Dynamic Trace Estimation
NeurIPS 2021
Graph Learning for Inverse Landscape Genetics
AAAI 2021
Fourier Sparse Leverage Scores and Approximate Kernel Learning
NeurIPS 2020
The Statistical Cost of Robust Kernel Hyperparameter Turning
NeurIPS 2020
Inferring Networks From Random Walk-Based Node Similarities
NeurIPS 2018
Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guarantees
ICML 2017
Recursive Sampling for the Nystrom Method
NeurIPS 2017
Principal Component Projection Without Principal Component Analysis
ICML 2016
Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decomposition
NeurIPS 2015