English

Invertible DenseNets

Machine Learning 2021-01-11 v3 Computer Vision and Pattern Recognition Machine Learning

Abstract

We introduce Invertible Dense Networks (i-DenseNets), a more parameter efficient alternative to Residual Flows. The method relies on an analysis of the Lipschitz continuity of the concatenation in DenseNets, where we enforce the invertibility of the network by satisfying the Lipschitz constraint. Additionally, we extend this method by proposing a learnable concatenation, which not only improves the model performance but also indicates the importance of the concatenated representation. We demonstrate the performance of i-DenseNets and Residual Flows on toy, MNIST, and CIFAR10 data. Both i-DenseNets outperform Residual Flows evaluated in negative log-likelihood, on all considered datasets under an equal parameter budget.

Keywords

Cite

@article{arxiv.2010.02125,
  title  = {Invertible DenseNets},
  author = {Yura Perugachi-Diaz and Jakub M. Tomczak and Sandjai Bhulai},
  journal= {arXiv preprint arXiv:2010.02125},
  year   = {2021}
}

Comments

Accepted at 3rd Symposium on Advances in Approximate Bayesian Inference (AABI)

R2 v1 2026-06-23T19:03:06.849Z