Vanishing component analysis

Roi Livni, David Lehavi, Sagi Schein, Hila Nachlieli, Shai Shalev-Shwartz, Amir Globerson

Research output: Contribution to conferencePaper

21 Scopus citations

Abstract

The vanishing ideal of a set of points, S ⊂ ℝn, is the set of all polynomials that attain the value of zero on all the points in S. Such ideals can be compactly represented using a small set of polynomials known as generators of the ideal. Here we describe and analyze an efficient procedure that constructs a set of generators of a vanishing ideal. Our procedure is numerically stable, and can be used to find approximately vanishing polynomials. The resulting polynomials capture nonlinear structure in data, and can for example be used within supervised learning. Empirical comparison with kernel methods show that our method constructs more compact classifiers with comparable accuracy.

Original languageEnglish (US)
Pages597-605
Number of pages9
StatePublished - Jan 1 2013
Event30th International Conference on Machine Learning, ICML 2013 - Atlanta, GA, United States
Duration: Jun 16 2013Jun 21 2013

Other

Other30th International Conference on Machine Learning, ICML 2013
CountryUnited States
CityAtlanta, GA
Period6/16/136/21/13

All Science Journal Classification (ASJC) codes

  • Human-Computer Interaction
  • Sociology and Political Science

Fingerprint Dive into the research topics of 'Vanishing component analysis'. Together they form a unique fingerprint.

  • Cite this

    Livni, R., Lehavi, D., Schein, S., Nachlieli, H., Shalev-Shwartz, S., & Globerson, A. (2013). Vanishing component analysis. 597-605. Paper presented at 30th International Conference on Machine Learning, ICML 2013, Atlanta, GA, United States.