DReS: Dual Reconstruction Smoothing for Functional Regularization
Not on the map. Why?
Abstract (arXiv)
Smoothness is a key inductive bias in machine learning and is closely related to generalization. Existing smoothness-inducing methods typically rely either on explicit gradient regularization, which often incurs substantial computational and memory overhead, or on data-mixing strategies, which are less naturally applicable to unsupervised and self-supervised settings. In this work, we propose textitDual Reconstruction Smoothing (DReS), a nonparametric regularization framework that induces smoothness through a spline-based auxiliary branch with shared model parameters. The method introduces no additional trainable parameters and can be applied to arbitrary submodules, making it suitable for unsupervised, self-supervised, and supervised regimes. We show theoretically that the discrepancy between the target function and its DReS approximation is controlled by higher-order smoothness quantities of the function, establishing the method as an implicit higher-order smoothness regularizer. Empirically, DReS improves representation learning across several self-supervised methods, improves generation quality in generative modeling, and achieves strong performance relative to competitive baselines in supervised learning.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 44 of its 62 references that are in the map. First posted on arXiv 30 Sep 2025.
Builds on
44 of 62 references.
References · 44
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
- 2016Wide Residual Networkscited by 3,057
- 2016Improved Techniques for Training GANscited by 2,938
- 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,875
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,857
- 2020Improved Baselines with Momentum Contrastive Learningcited by 2,282
- 2017Improved Training of Wasserstein GANscited by 2,223
- 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,080
32 more
- 2016Identity Mappings in Deep Residual Networkscited by 1,960
- 2021Barlow Twins: Self-Supervised Learning via Redundancy Reductioncited by 1,818
- 2016Understanding deep learning requires rethinking generalizationcited by 1,657
- 2017Accurate, Large Minibatch SGD: Training ImageNet in 1 Hourcited by 1,479
- 2019MixMatch: A Holistic Approach to Semi-Supervised Learningcited by 1,390
- 2021VICReg: Variance-Invariance-Covariance Regularization for Self-Supervised Learningcited by 1,013
- 2017Virtual Adversarial Training: A Regularization Method for Supervised and Semi-Supervised Learningcited by 918
- 2021Towards Out-Of-Distribution Generalization: A Surveycited by 431
- 2020Simple and Principled Uncertainty Estimation with Deterministic Deep Learning via Distance Awarenesscited by 389
- 2019Interpolation Consistency Training for Semi-Supervised Learningcited by 248
- 2017Improving the Adversarial Robustness and Interpretability of Deep Neural Networks by Regularizing their Input Gradientscited by 236
- 2020How to train your neural ODE: the world of Jacobian and kinetic regularizationcited by 228
- 2020How Does Mixup Help With Robustness and Generalization?cited by 193
- 2018Sensitivity and Generalization in Neural Networks: an Empirical Studycited by 187
- 2017Formal Guarantees on the Robustness of a Classifier against Adversarial Manipulationcited by 182
- 2017Sobolev Training for Neural Networkscited by 136
- 2019Robust Learning with Jacobian Regularizationcited by 127
- 2016Robust Large Margin Deep Neural Networkscited by 117
- 2021Solo-learn: A Library of Self-supervised Methods for Visual Representation Learningcited by 116
- 2018Improving DNN Robustness to Adversarial Attacks using Jacobian Regularizationcited by 88
- 2015Speeding Up Distributed Machine Learning Using Codescited by 76
- 2018Lagrange Coded Computing: Optimal Design for Resiliency, Security and Privacycited by 66
- 2019Scaleable input gradient regularization for adversarial robustnesscited by 45
- 2017Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplicationcited by 32
- 2019CodedPrivateML: A Fast and Privacy-Preserving Framework for Distributed Machine Learningcited by 20
- 2020Berrut Approximated Coded Computing: Straggler Resistance Beyond Polynomial Computingcited by 19
- 2018CodedSketch: A Coding Scheme for Distributed Computation of Approximated Matrix Multiplicationcited by 16
- 2020Improving Transformation Invariance in Contrastive Representation Learningcited by 16
- 2019A Closer Look at Double Backpropagationcited by 7
- 2024Coded Computing for Resilient Distributed Computing: A Learning-Theoretic Frameworkcited by 5
- 2025General Coded Computing: Adversarial Settingscited by 4
- 2025General Coded Computing in a Probabilistic Straggler Regimecited by 2
Built on by
Not cited yet.