Skip to yearly menu bar Skip to main content


Sorting out typicality with the inverse moment matrix SOS polynomial

Edouard Pauwels · Jean Lasserre

Area 5+6+7+8 #68

Keywords: [ Similarity and Distance Learning ] [ Convex Optimization ] [ (Other) Unsupervised Learning Methods ]


We study a surprising phenomenon related to the representation of a cloud of data points using polynomials. We start with the previously unnoticed empirical observation that, given a collection (a cloud) of data points, the sublevel sets of a certain distinguished polynomial capture the shape of the cloud very accurately. This distinguished polynomial is a sum-of-squares (SOS) derived in a simple manner from the inverse of the empirical moment matrix. In fact, this SOS polynomial is directly related to orthogonal polynomials and the Christoffel function. This allows to generalize and interpret extremality properties of orthogonal polynomials and to provide a mathematical rationale for the observed phenomenon. Among diverse potential applications, we illustrate the relevance of our results on a network intrusion detection task for which we obtain performances similar to existing dedicated methods reported in the literature.

Live content is unavailable. Log in and register to view live content