Signal Recovery from Pooling Representations
Joan Bruna, Arthur Szlam, Yann LeCun

TL;DR
This paper derives lower Lipschitz bounds for various pooling operators and demonstrates their invertibility in neural networks through numerical experiments, enabling phase recovery and inverse pooling with empirical validation.
Contribution
It provides new lower Lipschitz bounds for $\, ext{ell}_p$ pooling operators and shows their invertibility in neural networks with practical phase recovery methods.
Findings
Pooling layers can be inverted with phase recovery algorithms.
Lower Lipschitz bounds ensure the regularity of inverse pooling.
Empirical validation on MNIST confirms invertibility and phase recovery.
Abstract
In this work we compute lower Lipschitz bounds of pooling operators for as well as pooling operators preceded by half-rectification layers. These give sufficient conditions for the design of invertible neural network layers. Numerical experiments on MNIST and image patches confirm that pooling layers can be inverted with phase recovery algorithms. Moreover, the regularity of the inverse pooling, controlled by the lower Lipschitz constant, is empirically verified with a nearest neighbor regression.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsImage and Signal Denoising Methods · Sparse and Compressive Sensing Techniques · Model Reduction and Neural Networks
