Signal Recovery from Pooling Representations

11/16/2013
by   Joan Bruna, et al.
0

In this work we compute lower Lipschitz bounds of ℓ_p pooling operators for p=1, 2, ∞ as well as ℓ_p 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.

READ FULL TEXT
research
04/04/2023

The expressive power of pooling in Graph Neural Networks

In Graph Neural Networks (GNNs), hierarchical pooling operators generate...
research
11/28/2022

Lipschitz constant estimation for 1D convolutional neural networks

In this work, we propose a dissipativity-based method for Lipschitz cons...
research
03/10/2014

Phase Retrieval using Lipschitz Continuous Maps

In this note we prove that reconstruction from magnitudes of frame coeff...
research
12/15/2022

Graphon Pooling for Reducing Dimensionality of Signals and Convolutional Operators on Graphs

In this paper we propose a pooling approach for convolutional informatio...
research
04/03/2020

A Note on Double Pooling Tests

We present double pooling, a simple, easy-to-implement variation on test...
research
04/20/2023

Gauge-equivariant pooling layers for preconditioners in lattice QCD

We demonstrate that gauge-equivariant pooling and unpooling layers can p...
research
10/04/2019

Lipschitz Learning for Signal Recovery

We consider the recovery of signals from their observations, which are s...

Please sign up or login with your details

Forgot password? Click here to reset