A Meta-learning Formulation of the Autoencoder Problem for Non-linear Dimensionality Reduction

Andrey A. Popov, Arash Sarshar, Austin Chennault, Adrian Sandu
7/14/2022
cs.LG

No confident code implementation found for this paper.

Abstract

A rapidly growing area of research is the use of machine learning approaches such as autoencoders for dimensionality reduction of data and models in scientific applications. We show that the canonical formulation of autoencoders suffers from several deficiencies that can hinder their performance. Using a meta-learning approach, we reformulate the autoencoder problem as a bi-level optimization procedure that explicitly solves the dimensionality reduction task. We prove that the new formulation corrects the identified deficiencies with canonical autoencoders, provide a practical way to solve it, and showcase the strength of this formulation with a simple numerical illustration.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{popov2022metalearning,
  title  = {A Meta-learning Formulation of the Autoencoder Problem for Non-linear Dimensionality Reduction},
  author = {Andrey A. Popov and Arash Sarshar and Austin Chennault and Adrian Sandu},
  year   = {2022},
  eprint = {2207.06676},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2207.06676v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2207.06676.svg)](https://codeofpaper.com/paper/2207.06676)

Discussion