paper-with-me

Papers

Does SGD really happen in tiny subspaces?

2024-05-25 · Minhak Song, Kwangjun Ahn, Chulhee Yun

Understanding the training dynamics of deep neural networks is challenging due to their high-dimensional nature and intricate loss landscapes. Recent studies have revealed that, along the training trajectory, the gradient approximately aligns with a low-rank top eigenspace of the training loss Hessian, referred to as the dominant subspace. Given this alignment, this paper explores whether neural networks can be trained within the dominant subspace, which, if feasible, could lead to more efficient training methods. Our primary observation is that when the SGD update is projected onto the dominant subspace, the training loss does not decrease further. This suggests that the observed alignment between the gradient and the dominant subspace is spurious. Surprisingly, projecting out the dominant subspace proves to be just as effective as the original update, despite removing the majority of the original update component. We observe similar behavior across practical setups, including the large learning rate regime (also known as Edge of Stability), Sharpness-Aware Minimization, momentum, and adaptive optimizers. We discuss the main causes and implications of this spurious alignment, shedding light on the dynamics of neural network training.

📄 PDF Abstract BibTeX arXiv:2405.16002

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Sharpness-Aware Minimization Sharpness-Aware Minimization, or SAM, is a procedure that improves model generalization by simultaneously minimizing loss value and loss sharpness. SAM functions by…
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 제목 키워드 기반

Are Cluster Validity Measures (In)valid?

2022-08-02 · Marek Gagolewski, Maciej Bartoszuk, Anna Cena

Internal cluster validity measures (such as the Calinski-Harabasz, Dunn, or Davies-Bouldin indices) are frequently used for selecting the appropriate number of partitions a dataset should be split into. In this paper we …

valid

Fine-tuning Happens in Tiny Subspaces: Exploring Intrinsic Task-specific Subspaces of Pre-trained Language Models

2023-05-27 · Zhong Zhang, Bang Liu, Junming Shao

Pre-trained language models (PLMs) are known to be overly parameterized and have significant redundancy, indicating a small degree of freedom of the PLMs. Motivated by the observation, in this paper, we study the problem…

NegPSpan: efficient extraction of negative sequential patterns with embedding constraints

2018-04-04 · Thomas Guyet, René Quiniou

Mining frequent sequential patterns consists in extracting recurrent behaviors, modeled as patterns, in a big sequence dataset. Such patterns inform about which events are frequently observed in sequences, i.e. what does…

Futuristic Classification with Dynamic Reference Frame Strategy

2018-05-25 · Kumarjit Pathak, Jitin Kapila, Aasheesh Barvey

Classification is one of the widely used analytical techniques in data science domain across different business to associate a pattern which contribute to the occurrence of certain event which is predicted with some like…

ClassificationGeneral ClassificationPrediction

Is an Affine Constraint Needed for Affine Subspace Clustering?

2020-05-08 · ICCV 2019 10 · Chong You, Chun-Guang Li, Daniel P. Robinson, Rene Vidal

Subspace clustering methods based on expressing each data point as a linear combination of other data points have achieved great success in computer vision applications such as motion segmentation, face and digit cluster…

ClusteringFace ClusteringMotion Segmentation