Pith

open record

sign in

arxiv: 2305.01777 · v4 · pith:3DECISQO · submitted 2023-05-02 · cs.LG · math.DG

Representation Learning via Manifold Flattening and Reconstruction

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:3DECISQOrecord.jsonopen to challenge →

classification cs.LG math.DG
keywords datamanifoldnetworksflatteninglearningneuralalgorithmavailable
0
0 comments X
read the original abstract

This work proposes an algorithm for explicitly constructing a pair of neural networks that linearize and reconstruct an embedded submanifold, from finite samples of this manifold. Our such-generated neural networks, called Flattening Networks (FlatNet), are theoretically interpretable, computationally feasible at scale, and generalize well to test data, a balance not typically found in manifold-based learning methods. We present empirical results and comparisons to other models on synthetic high-dimensional manifold data and 2D image data. Our code is publicly available.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.