K-Deep Simplex: Deep Manifold Learning via Local Dictionaries

Authors Pranay Tankala, Abiy Tasissa, James M. Murphy, Demba Ba

Publication date 3 December 2020

Has companion code repository https://github.com/pbt17/manifold-learning-with-simplex-constraints

Abstract: We propose K-Deep Simplex (KDS) which, given a set of data points, learns a dictionary comprising synthetic landmarks, along with representation coefficients supported on a simplex. KDS integrates manifold learning and sparse coding/dictionary learning: reconstruction term, as in classical dictionary learning, and a novel local weighted

e l l_{1}

penalty that encourages each data point to represent itself as a convex combination of nearby landmarks. We solve the proposed optimization program using alternating minimization and design an efficient, interpretable autoencoder using algorithm enrolling. We theoretically analyze the proposed program by relating the weighted

e l l_{1}

penalty in KDS to a weighted

e l l_{0}

program. Assuming that the data are generated from a Delaunay triangulation, we prove the equivalence of the weighted

e l l_{1}

and weighted

e l l_{0}

programs. If the representation coefficients are given, we prove that the resulting dictionary is unique. Further, we show that low-dimensional representations can be efficiently obtained from the covariance of the coefficient matrix. We apply KDS to the unsupervised clustering problem and prove theoretical performance guarantees. Experiments show that the algorithm is highly efficient and performs competitively on synthetic and real data sets.

This page was built for publication: K-Deep Simplex: Deep Manifold Learning via Local Dictionaries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6355255)