LU-Net: Invertible Neural Networks Based on Matrix Factorization

Robin Chan, Sarina Penquitt, Hanno Gottschalk
2/21/2023
cs.LGcs.NE

No confident code implementation found for this paper.

Abstract

LU-Net is a simple and fast architecture for invertible neural networks (INN) that is based on the factorization of quadratic weight matrices $\mathsf{A=LU}$, where $\mathsf{L}$ is a lower triangular matrix with ones on the diagonal and $\mathsf{U}$ an upper triangular matrix. Instead of learning a fully occupied matrix $\mathsf{A}$, we learn $\mathsf{L}$ and $\mathsf{U}$ separately. If combined with an invertible activation function, such layers can easily be inverted whenever the diagonal entries of $\mathsf{U}$ are different from zero. Also, the computation of the determinant of the Jacobian matrix of such layers is cheap. Consequently, the LU architecture allows for cheap computation of the likelihood via the change of variables formula and can be trained according to the maximum likelihood principle. In our numerical experiments, we test the LU-net architecture as generative model on several academic datasets. We also provide a detailed comparison with conventional invertible neural networks in terms of performance, training as well as run time.

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{chan2023lunet,
  title  = {LU-Net: Invertible Neural Networks Based on Matrix Factorization},
  author = {Robin Chan and Sarina Penquitt and Hanno Gottschalk},
  year   = {2023},
  eprint = {2302.10524},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2302.10524v1}
}

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/2302.10524.svg)](https://codeofpaper.com/paper/2302.10524)

Discussion