← Search

Robert Krauthgamer

7 accepted papers

2021

Coresets for Clustering with Missing Values

NeurIPS 2021spotlight

We provide the first coreset for clustering points in $\mathbb{R}^d$ that have multiple missing values (coordinates). Previous coreset constructions only allow one missing coordinate. The challenge in this setting is that objective functions, like \kMeans, are evaluated only on the set of available…

Cited by 21SourcePDFScholar
2020

Coresets for Clustering in Graphs of Bounded Treewidth

ICML 2020poster

We initiate the study of coresets for clustering in graph metrics, i.e., the shortest-path metric of edge-weighted graphs. Such clustering problems are essential to data analysis and used for example in road networks and data visualization. A coreset is a compact summary of the data that approximate…

Cited by 43SourcePDFScholar
2020

Schatten Norms in Matrix Streams: Hello Sparsity, Goodbye Dimension

ICML 2020poster

Spectral functions of large matrices contains important structural information about the underlying data, and is thus becoming increasingly important. Many times, large matrices representing real-world data are sparse or doubly sparse (i.e., sparse in both rows and columns), and are accessed as a st…

Cited by 18SourcePDFScholar
2018

Matrix Norms in Data Streams: Faster, Multi-Pass and Row-Order

ICML 2018oral

A central problem in mining massive data streams is characterizing which functions of an underlying frequency vector can be approximated efficiently. Given the prevalence of large scale linear algebra problems in machine learning, recently there has been considerable effort in extending this data st…

Cited by 23SourcePDFScholar