← Search

Ryan Curtin

2 accepted papers

2020

Rk-means: Fast Clustering for Relational Data

AISTATS 2020poster

Conventional machine learning algorithms cannot be applied until a data matrix is available to process. When the data matrix needs to be obtained from a relational database via a feature extraction query, the computation cost can be prohibitive, as the data matrix may be (much) larger than the total…

Cited by 22SourcePDFScholar
2020

Unconditional Coresets for Regularized Loss Minimization

AISTATS 2020poster

We design and mathematically analyze sampling-based algorithms for regularized loss minimization problems that are implementable in popular computational models for large data, in which the access to the data is restricted in some way. Our main result is that if the regularizer’s effect does not bec…

Cited by 11SourcePDFScholar