← Search

Xavier Carreras

2 accepted papers

2017

A Maximum Matching Algorithm for Basis Selection in Spectral Learning

AISTATS 2017poster

We present a solution to scale spectral algorithms for learning sequence functions. We are interested in the case where these functions are sparse (that is, for most sequences they return 0). Spectral algorithms reduce the learning problem to the task of computing an SVD decomposition over a specia…

Cited by 11SourcePDFScholar