Information-Theoretic Generalization Bounds for SGLD via Data-Dependent Estimates
원문 초록
In this work, we improve upon the stepwise analysis of noisy iterative learning algorithms initiated by Pensia, Jog, and Loh (2018) and recently extended by Bu, Zou, and Veeravalli (2019). Our main contributions are significantly improved mutual information bounds for Stochastic Gradient Langevin Dynamics via data-dependent estimates. Our approach is based on the variational characterization of mutual information and the use of data-dependent priors that forecast the mini-batch gradient based on a subset of the training samples. Our approach is broadly applicable within the information-theoretic framework of Russo and Zou (2015) and Xu and Raginsky (2017). Our bound can be tied to a measure of flatness of the empirical risk surface. As compared with other bounds that depend on the squared norms of gradients, empirical investigations show that the terms in our bounds are orders of magnitude smaller.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Learning Where to Learn: Training Distribution Selection for Provable OOD Performance
Operator Learning for Schrödinger Equation: Unitarity, Error Bounds, and Time Generalization
Graph Representational Learning: When Does More Expressivity Hurt Generalization?
Model Steering: Learning with a Reference Model Improves Generalization Bounds and Scaling Laws
Achieving Distributive Justice in Federated Learning via Uncertainty Quantification
Adversarial Transform Particle Filters
토론
이 논문과 연결된 포럼 글이 아직 없습니다.