Cover Image

Critical Influence of Overparameterization on Sharpness-aware Minimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Shin, Sungbin, Lee, Dongyeop, Andriushchenko, Maksym, Lee, Namhoon
Format:	Preprint
Published:	2023
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Passivity-Based Method for Accelerated Convex Optimisation
by: Cho, Namhoon, et al.
Published: (2023)

Sharp Global Guarantees for Nonconvex Low-rank Recovery in the Noisy Overparameterized Regime
by: Zhang, Richard Y.
Published: (2021)

SASSHA: Sharpness-aware Adaptive Second-order Optimization with Stable Hessian Approximation
by: Shin, Dahun, et al.
Published: (2025)

DGSAM: Domain Generalization via Individual Sharpness-Aware Minimization
by: Song, Youngjun, et al.
Published: (2025)

Sharpness-Aware Minimization Can Hallucinate Minimizers
by: Park, Chanwoong, et al.
Published: (2025)

Incremental Correction in Dynamic Systems Modelled with Neural Networks for Constraint Satisfaction
by: Cho, Namhoon, et al.
Published: (2022)

Regularized Gauss-Newton for Optimizing Overparameterized Neural Networks
by: Adeoye, Adeyemi D., et al.
Published: (2024)

Sharpness-Aware Minimization: General Analysis and Improved Rates
by: Oikonomou, Dimitris, et al.
Published: (2025)

Implicit Regularization Makes Overparameterized Asymmetric Matrix Sensing Robust to Perturbations
by: Wind, Johan S.
Published: (2023)

Improved Global Guarantees for the Nonconvex Burer--Monteiro Factorization via Rank Overparameterization
by: Zhang, Richard Y.
Published: (2022)

Non-Asymptotic Optimization and Generalization Bounds for Stochastic Gauss-Newton in Overparameterized Models
by: Cayci, Semih
Published: (2025)

Rethinking Pruning Large Language Models: Benefits and Pitfalls of Reconstruction Error Minimization
by: Shin, Sungbin, et al.
Published: (2024)

Preconditioned Gradient Descent for Overparameterized Nonconvex Burer--Monteiro Factorization with Global Optimality Certification
by: Zhang, Gavin, et al.
Published: (2022)

Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery
by: Giampouras, Paris, et al.
Published: (2024)

On the Benefits of Weight Normalization for Overparameterized Matrix Sensing
by: Wei, Yudong, et al.
Published: (2025)

More is Less: Inducing Sparsity via Overparameterization
by: Chou, Hung-Hsu, et al.
Published: (2021)

Convergence of Sharpness-Aware Minimization Algorithms using Increasing Batch Size and Decaying Learning Rate
by: Harada, Hinata, et al.
Published: (2024)

Parameter-Free Algorithms for Performative Regret Minimization under Decision-Dependent Distributions
by: Park, Sungwoo, et al.
Published: (2024)

Adaptive Sharpness-Aware Minimization with a Polyak-type Step size: A Theory-Grounded Scheduler
by: Oikonomou, Dimitris, et al.
Published: (2026)

The Power of Preconditioning in Overparameterized Low-Rank Matrix Sensing
by: Xu, Xingyu, et al.
Published: (2023)

On the Convergence of Overparameterized Problems: Inherent Properties of the Compositional Structure of Neural Networks
by: de Oliveira, Arthur Castello Branco, et al.
Published: (2025)

Synchronisation-Oriented Design Approach for Adaptive Control
by: Cho, Namhoon, et al.
Published: (2024)

Achieving $ε^{-2}$ Sample Complexity for Single-Loop Actor-Critic under Minimal Assumptions
by: Hamza, Ishaq, et al.
Published: (2026)

Sharpness of Minima in Deep Matrix Factorization
by: Kamber, Anil, et al.
Published: (2025)

On the Duality Between Sharpness-Aware Minimization and Adversarial Training
by: Zhang, Yihao, et al.
Published: (2024)

Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More
by: Bu, Fanchen, et al.
Published: (2024)

Lotka-Sharpe Neural Operators for Control of Population PDEs
by: Krstic, Miroslav, et al.
Published: (2026)

Adaptive Algorithms with Sharp Convergence Rates for Stochastic Hierarchical Optimization
by: Gong, Xiaochuan, et al.
Published: (2025)

Does SGD Seek Flatness or Sharpness? An Exactly Solvable Model
by: Xu, Yizhou, et al.
Published: (2026)

Mitigating Staleness in Asynchronous Pipeline Parallelism via Basis Rotation
by: Jung, Hyunji, et al.
Published: (2026)

ROOT-SGD: Sharp Nonasymptotics and Near-Optimal Asymptotics in a Single Algorithm
by: Li, Chris Junchi, et al.
Published: (2020)

Improved Regret Bound for Safe Reinforcement Learning via Tighter Cost Pessimism and Reward Optimism
by: Yu, Kihyun, et al.
Published: (2024)

Sharp High-Probability Rates for Nonlinear SGD under Heavy-Tailed Noise via Symmetrization
by: Armacki, Aleksandar, et al.
Published: (2025)

Efficient Continual Finite-Sum Minimization
by: Mavrothalassitis, Ioannis, et al.
Published: (2024)

Planning and Learning in Average Risk-aware MDPs
by: Wang, Weikai, et al.
Published: (2025)

Optimal Algorithms for Stochastic Complementary Composite Minimization
by: d'Aspremont, Alexandre, et al.
Published: (2022)

An Equivalence Between Static and Dynamic Regret Minimization
by: Jacobsen, Andrew, et al.
Published: (2024)

Global Optimization via Softmin Energy Minimization
by: Agazzi, Andrea, et al.
Published: (2025)

Stochastic-Constrained Stochastic Optimization with Markovian Data
by: Kim, Yeongjong, et al.
Published: (2023)

Meta-reinforcement learning with minimum attention
by: Gupta, Shashank, et al.
Published: (2025)