mlsanityData to 7 Oct 2026

DReS: Dual Reconstruction Smoothing for Functional Regularization

arXiv 2510.00253 ↗First posted 30 Sep 2025cs.LGcited by 0

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

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  4. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
  5. 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
  6. 2016Wide Residual Networkscited by 3,057
  7. 2016Improved Techniques for Training GANscited by 2,938
  8. 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,875
  9. 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,857
  10. 2020Improved Baselines with Momentum Contrastive Learningcited by 2,282
  11. 2017Improved Training of Wasserstein GANscited by 2,223
  12. 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,080
32 more
  1. 2016Identity Mappings in Deep Residual Networkscited by 1,960
  2. 2021Barlow Twins: Self-Supervised Learning via Redundancy Reductioncited by 1,818
  3. 2016Understanding deep learning requires rethinking generalizationcited by 1,657
  4. 2017Accurate, Large Minibatch SGD: Training ImageNet in 1 Hourcited by 1,479
  5. 2019MixMatch: A Holistic Approach to Semi-Supervised Learningcited by 1,390
  6. 2021VICReg: Variance-Invariance-Covariance Regularization for Self-Supervised Learningcited by 1,013
  7. 2017Virtual Adversarial Training: A Regularization Method for Supervised and Semi-Supervised Learningcited by 918
  8. 2021Towards Out-Of-Distribution Generalization: A Surveycited by 431
  9. 2020Simple and Principled Uncertainty Estimation with Deterministic Deep Learning via Distance Awarenesscited by 389
  10. 2019Interpolation Consistency Training for Semi-Supervised Learningcited by 248
  11. 2017Improving the Adversarial Robustness and Interpretability of Deep Neural Networks by Regularizing their Input Gradientscited by 236
  12. 2020How to train your neural ODE: the world of Jacobian and kinetic regularizationcited by 228
  13. 2020How Does Mixup Help With Robustness and Generalization?cited by 193
  14. 2018Sensitivity and Generalization in Neural Networks: an Empirical Studycited by 187
  15. 2017Formal Guarantees on the Robustness of a Classifier against Adversarial Manipulationcited by 182
  16. 2017Sobolev Training for Neural Networkscited by 136
  17. 2019Robust Learning with Jacobian Regularizationcited by 127
  18. 2016Robust Large Margin Deep Neural Networkscited by 117
  19. 2021Solo-learn: A Library of Self-supervised Methods for Visual Representation Learningcited by 116
  20. 2018Improving DNN Robustness to Adversarial Attacks using Jacobian Regularizationcited by 88
  21. 2015Speeding Up Distributed Machine Learning Using Codescited by 76
  22. 2018Lagrange Coded Computing: Optimal Design for Resiliency, Security and Privacycited by 66
  23. 2019Scaleable input gradient regularization for adversarial robustnesscited by 45
  24. 2017Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplicationcited by 32
  25. 2019CodedPrivateML: A Fast and Privacy-Preserving Framework for Distributed Machine Learningcited by 20
  26. 2020Berrut Approximated Coded Computing: Straggler Resistance Beyond Polynomial Computingcited by 19
  27. 2018CodedSketch: A Coding Scheme for Distributed Computation of Approximated Matrix Multiplicationcited by 16
  28. 2020Improving Transformation Invariance in Contrastive Representation Learningcited by 16
  29. 2019A Closer Look at Double Backpropagationcited by 7
  30. 2024Coded Computing for Resilient Distributed Computing: A Learning-Theoretic Frameworkcited by 5
  31. 2025General Coded Computing: Adversarial Settingscited by 4
  32. 2025General Coded Computing in a Probabilistic Straggler Regimecited by 2

Built on by

Not cited yet.