Revisiting clustering as matrix factorisation on the Stiefel manifold

03/11/2019
by   Stéphane Chrétien, et al.
0

This paper studies clustering for possibly high dimensional data (e.g. images, time series, gene expression data, and many other settings), and rephrase it as low rank matrix estimation in the PAC-Bayesian framework. Our approach leverages the well known Burer-Monteiro factorisation strategy from large scale optimisation, in the context of low rank estimation. Moreover, our Burer-Monteiro factors are shown to lie on a Stiefel manifold. We propose a new generalized Bayesian estimator for this problem and prove novel prediction bounds for clustering. We also devise a componentwise Langevin sampler on the Stiefel manifold to compute this estimator.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/17/2022

On a low-rank matrix single index model

In this paper, we present a theoretical study of a low-rank matrix singl...
research
06/17/2013

Bayesian methods for low-rank matrix estimation: short survey and theoretical study

The problem of low-rank matrix estimation recently received a lot of att...
research
11/09/2020

Statistical Query Complexity of Manifold Estimation

This paper studies the statistical query (SQ) complexity of estimating d...
research
08/27/2020

Implicit Regularization in Matrix Sensing: A Geometric View Leads to Stronger Results

We may think of low-rank matrix sensing as a learning problem with infin...
research
08/11/2022

Low-rank Matrix Estimation with Inhomogeneous Noise

We study low-rank matrix estimation for a generic inhomogeneous output c...
research
04/13/2021

Solving weakly supervised regression problem using low-rank manifold regularization

We solve a weakly supervised regression problem. Under "weakly" we under...
research
05/05/2014

Model Consistency of Partly Smooth Regularizers

This paper studies least-square regression penalized with partly smooth ...

Please sign up or login with your details

Forgot password? Click here to reset