arXiv Machine Learning By Yeheng Ge, Jian Huang, Shuyuan Wu

Statistical and Privacy Guarantees for Deep M-Regression via Stochastic Gradient Langevin Dynamics

Read the original on arXiv Machine Learning →

The paper analyzes deep nonparametric regression trained with stochastic gradient Langevin dynamics (SGLD), a stochastic gradient method that adds Gaussian noise. Using a PAC‑Bayesian framework for deep ReLU networks, it derives an excess‑risk bound that incorporates network approximation error, statistical complexity, and the cumulative effect of the SGLD trajectory. The study also provides differential privacy guarantees for per‑sample clipped SGLD and demonstrates the method’s predictive performance and privacy‑utility trade‑offs through simulations and real data experiments.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Jul 30

Minimax-Optimal Generalization Bounds for Smooth Deep Neural Networks Trained by (Stochastic) Gradient Descent

arXiv:2606. 06772v2 Announce Type: replace-cross Abstract: Characterizing the optimization dynamics and statistical performance of over-parameterized deep neural networks (DNNs) remains a central challenge in understanding the remarkable success of deep learning.

By Junyu Zhou, Puyu Wang, Dennis Wagner, Yunwen Lei, Marius Kloft, Yiming Ying