Sharp Reconstruction Bounds for Autoencoders Using the Same Forward Map
Not on the map. Why?
Abstract (arXiv)
We study reconstruction in autoencoders that apply the same forward map before and after setting the observed coordinates to zero. For equal odd input and hidden dimensions d≥ 3, among orientation-preserving diffeomorphisms whose Jacobian singular values lie in [m,M], we show that the least uniform reconstruction-derivative error is max1-M(M-m)/2,0, with affine maps attaining this sharp bound at every prescribed depth. A translated radial rotation can nevertheless reconstruct any prescribed ball exactly with singular values arbitrarily close to one, motivating additional conditions for a finite-data bound. We test this prediction on a 798,452-point terrestrial LiDAR forest scan. At input scale 0.05, the mean theoretical bound is 0.155, about 84% of the mean normalized training error 0.185 across four spatial regions, two depths, and three seeds. At this scale, adding one hidden coordinate reduces the mean reconstruction error below 6×10-6.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 9 of its 13 references that are in the map. First posted on arXiv 17 Sep 2026.
Builds on
9 of 13 references.
References · 9
- 2018Invertible Residual Networkscited by 365
- 2017Stable Architectures for Deep Neural Networkscited by 341
- 2015Unitary Evolution Recurrent Neural Networkscited by 294
- 2019Cheap Orthogonal Constraints in Neural Networks: A Simple Parametrization of the Orthogonal and Unitary Groupcited by 134
- 2019Loss Landscapes of Regularized Linear Autoencoderscited by 46
- 2023Geometric Autoencoders -- What You See is What You Decodecited by 23
- 2026Statistical and structural identifiability in representation learningcited by 6
- 2025Integrating Product Coefficients for Improved 3D LiDAR Data Classification (Part II)cited by 2
- 2026Bi-Lipschitz Autoencoder With Injectivity Guaranteecited by 1
Built on by
Not cited yet.