mlsanityData to 14 Oct 2026

Improving Optimization for Models With Continuous Symmetry Breaking

arXiv 1803.03234 ↗First posted 8 Mar 2018stat.ML cs.LGcited by 8

Not on the map. Why?

Abstract (arXiv)

Many loss functions in representation learning are invariant under a continuous symmetry transformation. For example, the loss function of word embeddings (Mikolov et al., 2013) remains unchanged if we simultaneously rotate all word and context embedding vectors. We show that representation learning models for time series possess an approximate continuous symmetry that leads to slow convergence of gradient descent. We propose a new optimization algorithm that speeds up convergence using ideas from gauge theory in physics. Our algorithm leads to orders of magnitude faster convergence and to more interpretable representations, as we show for dynamic extensions of matrix factorization and word embedding models. We further present an example application of our proposed algorithm that translates modern words into their historic equivalents.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). First posted on arXiv 8 Mar 2018.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 2; 2023: 1; 2024: 1; 2025: 3.

8 papers.