Name
Abstract | ||
|---|---|---|
In this work we compute lower Lipschitz bounds of $\ell_p$ pooling operators for $p=1, 2, \infty$ as well as $\ell_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. |
Year | Venue | Field |
|---|---|---|
2014 | ICML | Applied mathematics,MNIST database,Artificial intelligence,Operator (computer programming),Lipschitz continuity,Artificial neural network,k-nearest neighbors algorithm,Inverse,Combinatorics,Pattern recognition,Pooling,Invertible matrix,Mathematics |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. Bruna | 1 | 1697 | 82.95 |
| Arthur Szlam | 2 | 1056 | 68.60 |
| Yann LeCun | 3 | 26090 | 3771.21 |