mlsanityData to 14 Oct 2026

Sharpness-Aware Teleportation on Riemannian Manifolds

arXiv 2309.17215 ↗First posted 29 Sep 2023cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Recent studies highlight the effectiveness of flat minima in enhancing generalization, with sharpness-aware minimization (SAM) achieving state-of-the-art performance. Additionally, insights into the intrinsic geometry of the loss landscape have shown promise for improving model generalization. Building on these advancements, we introduce a novel sharpness-aware, geometry-aware teleportation mechanism to further enhance robustness and generalization. The core innovation of our approach is to decompose each iteration into a teleportation step within a local orbit and a sharpness-aware step that transitions between different orbits, leveraging the Riemannian quotient manifold. Our approach is grounded in a theoretical framework that analyzes the generalization gap between population loss and worst-case empirical loss within the context of Riemannian manifolds. To demonstrate the effectiveness of our method, we evaluate and compare our algorithm on diverse vision benchmarks with various datasets and Riemannian manifolds.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 31 of its 52 references that are in the map. First posted on arXiv 29 Sep 2023.

Builds on

31 of 52 references.

References · 31

  1. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  2. 2016DeepLab: Semantic Image Segmentation with Deep Convolutional Nets, Atrous Convolution, and Fully Connected CRFscited by 3,241
  3. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
  4. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
  5. 2016Group Equivariant Convolutional Networkscited by 1,165
  6. 2017Remote Sensing Image Scene Classification: Benchmark and State of the Artcited by 797
  7. 2017Dynamic Routing Between Capsulescited by 689
  8. 2016NTU RGB+D: A Large Scale Dataset for 3D Human Activity Analysiscited by 686
  9. 2021SWAD: Domain Generalization by Seeking Flat Minimacited by 434
  10. 2021ASAM: Adaptive Sharpness-Aware Minimization for Scale-Invariant Learning of Deep Neural Networkscited by 293
  11. 2021When Vision Transformers Outperform ResNets without Pre-training or Strong Data Augmentationscited by 260
  12. 2017First-Person Hand Action Benchmark with RGB-D Videos and 3D Hand Pose Annotationscited by 230
19 more
  1. 2018Riemannian Adaptive Optimization Methodscited by 194
  2. 2022Surrogate Gap Minimization Improves Sharpness-Aware Trainingcited by 172
  3. 2016A Riemannian Network for SPD Matrix Learningcited by 162
  4. 2020The Break-Even Point on Optimization Trajectories of Deep Neural Networkscited by 150
  5. 2022Generalized Federated Learning via Sharpness Aware Minimizationcited by 144
  6. 2022Towards Efficient and Scalable Sharpness-Aware Minimizationcited by 129
  7. 2019Orthogonal Convolutional Neural Networkscited by 123
  8. 2021Sharpness-Aware Minimization Improves Language Model Generalizationcited by 108
  9. 2022Sharpness-Aware Training for Freecited by 95
  10. 2022When Do Flat Minima Optimizers Work?cited by 78
  11. 2016Global rates of convergence for nonconvex optimization on manifoldscited by 62
  12. 2017All You Need is Beyond a Good Init: Exploring Better Solution for Training Extremely Deep Convolutional Neural Networks with Orthonormality and Modulationcited by 58
  13. 2022Sharp-MAML: Sharpness-Aware Model-Agnostic Meta Learningcited by 58
  14. 2020Orthogonal Over-Parameterized Trainingcited by 44
  15. 2022SAM as an Optimal Relaxation of Bayescited by 41
  16. 2020Computationally Tractable Riemannian Manifolds for Graph Embeddingscited by 29
  17. 2023Improving Convergence and Generalization Using Parameter Symmetriescited by 23
  18. 2023Flat Seeking Bayesian Neural Networkscited by 10
  19. 2023Optimal Transport Model Distributional Robustnesscited by 5

Built on by

Not cited yet.