paper-with-me

홈 › Papers

Shift-Curvature, SGD, and Generalization

2021-08-21 · Arwen V. Bradley, Carlos Alberto Gomez-Uribe, Manish Reddy Vuyyuru

A longstanding debate surrounds the related hypotheses that low-curvature minima generalize better, and that SGD discourages curvature. We offer a more complete and nuanced view in support of both. First, we show that curvature harms test performance through two new mechanisms, the shift-curvature and bias-curvature, in addition to a known parameter-covariance mechanism. The three curvature-mediated contributions to test performance are reparametrization-invariant although curvature is not. The shift in the shift-curvature is the line connecting train and test local minima, which differ due to dataset sampling or distribution shift. Although the shift is unknown at training time, the shift-curvature can still be mitigated by minimizing overall curvature. Second, we derive a new, explicit SGD steady-state distribution showing that SGD optimizes an effective potential related to but different from train loss, and that SGD noise mediates a trade-off between deep versus low-curvature regions of this effective potential. Third, combining our test performance analysis with the SGD steady state shows that for small SGD noise, the shift-curvature may be the most significant of the three mechanisms. Our experiments confirm the impact of shift-curvature on test loss, and further explore the relationship between SGD noise and curvature.

📄 PDF Abstract BibTeX arXiv:2108.09507

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

SGD Stochastic Gradient Descent is an iterative optimization technique that uses minibatches of data to form an expectation of the gradient, rather than the full gradient using…

Similar Papers 제목 키워드 기반

How Robust is Your Fairness? Evaluating and Sustaining Fairness under Unseen Distribution Shifts

2022-07-04 · Haotao Wang, Junyuan Hong, Jiayu Zhou, Zhangyang Wang

Increasing concerns have been raised on deep learning fairness in recent years. Existing fairness-aware machine learning methods mainly focus on the fairness of in-distribution data. However, in real-world applications, …

Fairness

Fix the Loss, Not the Radius: Rethinking the Adversarial Perturbation of Sharpness-Aware Minimization

2026-05-11 · Jinping Wang, Qinhan Liu, Zhiwu Xie, Zhiqiang Gao arxiv

Sharpness-Aware Minimization (SAM) improves generalization by minimizing the worst-case loss within a fixed parameter-space radius neighborhood. SAM and its variants mainly rely on a first-order linearized surrogate, whi…

A Self-supervised Riemannian GNN with Time Varying Curvature for Temporal Graph Learning

2022-08-30 · Li Sun, Junda Ye, Hao Peng, Philip S. Yu

Representation learning on temporal graphs has drawn considerable research attention owing to its fundamental importance in a wide spectrum of real-world applications. Though a number of studies succeed in obtaining time…

Graph LearningGraph Neural NetworkGraph Representation LearningRepresentation Learning+1

Curvature of Hypergraphs via Multi-Marginal Optimal Transport

2018-03-22 · Shahab Asoodeh, Tingran Gao, James Evans

We introduce a novel definition of curvature for hypergraphs, a natural generalization of graphs, by introducing a multi-marginal optimal transport problem for a naturally defined random walk on the hypergraph. This curv…

The Geometry of Robustness: Optimizing Loss Landscape Curvature and Feature Manifold Alignment for Robust Finetuning of Vision-Language Models

2026-03-28 · Shivang Chopra, Shaunak Halbe, Chengyue Huang, Brisa Maneechotesuwan 외 arxiv

Fine-tuning approaches for Vision-Language Models (VLMs) face a critical three-way trade-off between In-Distribution (ID) accuracy, Out-of-Distribution (OOD) generalization, and adversarial robustness. Existing robust fi…

Adversarial Robustness