Local-Order Auxiliary Losses Can Improve Autoencoder Reconstruction
Not on the map. Why?
Abstract (arXiv)
Mean-squared error is the default objective for training autoencoders, yet compressed reconstructions often depend not only on pointwise accuracy but also on preserving local spatial order. We study whether structural auxiliary losses can improve, rather than trade off against, MSE in finite-capacity autoencoders. We introduce finite-difference sign error (FDSE), a local-order auxiliary objective that penalizes disagreements between the signs of neighboring finite differences in the target and reconstruction. FDSE is simple, architecture-agnostic, and differentiable through smooth sign surrogates. Across four tensor reconstruction tasks, we find that moderate mixtures of MSE and FDSE can substantially reduce validation MSE relative to pure MSE training. In coefficient sweeps, FDSE mixtures reduce validation MSE by 2.3×--7.0× over pure MSE on these tasks, while comparisons with other auxiliary objectives show FDSE to be among the strongest structural objectives tested. The effect is not universal: pure FDSE performs poorly, and gains are largest for coherent spatial fields where local order carries information about the underlying signal. These results suggest that, in compressed-latent reconstruction, appropriately weighted local-structure supervision can guide optimization toward solutions with better pointwise accuracy, rather than merely improving perceptual or structural metrics at MSE's expense.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 24 of its 40 references that are in the map. First posted on arXiv 5 Apr 2025.
Builds on
24 of 40 references.
References · 24
- 2017Multi-Task Learning Using Uncertainty to Weigh Losses for Scene Geometry and Semanticscited by 1,358
- 2020Gradient Surgery for Multi-Task Learningcited by 1,256
- 2017GradNorm: Gradient Normalization for Adaptive Loss Balancing in Deep Multitask Networkscited by 834
- 2018Multi-Task Learning as Multi-Objective Optimizationcited by 821
- 2018Joint Autoregressive and Hierarchical Priors for Learned Image Compressioncited by 664
- 2024Scaling and evaluating sparse autoencoderscited by 553
- 2018End-to-End Multi-Task Learning with Attentioncited by 534
- 2021Conflict-Averse Gradient Descent for Multi-task Learningcited by 459
- 2015Adversarial Autoencoderscited by 364
- 2019Topology-Preserving Deep Image Segmentationcited by 198
- 2019Topological Autoencoderscited by 127
- 2017Deep Learning with Topological Signaturescited by 114
12 more
- 2021Reasonable Effectiveness of Random Weighting: A Litmus Test for Multi-Task Learningcited by 101
- 2024ImageFolder: Autoregressive Image Generation with Folded Tokenscited by 94
- 2019A Topology Layer for Machine Learningcited by 80
- 2021Topology-Aware Segmentation Using Discrete Morse Theorycited by 75
- 2024SoftVQ-VAE: Efficient 1-Dimensional Continuous Tokenizercited by 56
- 2023QARV: Quantization-Aware ResNet VAE for Lossy Image Compressioncited by 32
- 2023Learning Topology-Preserving Data Representationscited by 31
- 2024Boosting Latent Diffusion with Perceptual Objectivescited by 20
- 2024Epsilon-VAE: Denoising as Visual Decodingcited by 16
- 2024EAGLE: An Edge-Aware Gradient Localization Enhanced Loss for CT Image Reconstructioncited by 5
- 2025Balanced Rate-Distortion Optimization in Learned Image Compressioncited by 5
- 2021Geometry-Aware Merge Tree Comparisons for Time-Varying Data with Interleaving Distancescited by 4
Built on by
Not cited yet.