Papers βΊ LU-Net: Invertible Neural Networks Based on Matrix Factorization
LU-Net: Invertible Neural Networks Based on Matrix Factorization
Robin Chan, Sarina Penquitt, Hanno Gottschalk
LU-Net is a simple and fast architecture for invertible neural networks (INN) that is based on the factorization of quadratic weight matrices π =π«π΄, where π« is a lower triangular matrix with ones on the diagonal and π΄ an upper triangular matrix. Instead of learning a fully occupied matrix π , we learn π« and π΄ separately. If combined with an invertible activation function, such layers can easily be inverted whenever the diagonal entries of π΄ 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.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Methods
Report a problem or propose a change Β· a person checks every report against the paper or source before anything changes; decisions are listed on /corrections