Cover Image

Sharpness of Minima in Deep Matrix Factorization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kamber, Anil, Parhi, Rahul
Format:	Preprint
Published:	2025
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

On the Loss Landscape Geometry of Regularized Deep Matrix Factorization: Uniqueness and Sharpness
by: Kamber, Anil, et al.
Published: (2026)

Nonasymptotic Convergence Rates for Plug-and-Play Methods With MMSE Denoisers
by: Pritchard, Henry, et al.
Published: (2025)

Nonnegative Low-rank Matrix Recovery Can Have Spurious Local Minima
by: Zhang, Richard Y.
Published: (2025)

Implicit Regularization in Perturbed Deep Matrix Factorization: Spectral Conditions and Stability
by: Wang, Jingzhe, et al.
Published: (2026)

Hidden Minima in Two-Layer ReLU Networks
by: Arjevani, Yossi
Published: (2023)

LoRA Training in the NTK Regime has No Spurious Local Minima
by: Jang, Uijeong, et al.
Published: (2024)

Gradient Descent with Polyak's Momentum Finds Flatter Minima via Large Catapults
by: Phunyaphibarn, Prin, et al.
Published: (2023)

Gradient Descent Converges Linearly to Flatter Minima than Gradient Flow in Shallow Linear Networks
by: Beneventano, Pierfrancesco, et al.
Published: (2025)

From Saddle Points Toward Global Minima: A Newton-Type Method on Wasserstein Space
by: Lascu, Razvan-Andrei, et al.
Published: (2026)

Sum-of-norms regularized Nonnegative Matrix Factorization
by: Ang, Andersen, et al.
Published: (2024)

Convergence of Alternating Gradient Descent for Matrix Factorization
by: Ward, Rachel, et al.
Published: (2023)

Zeroth-Order Optimization Finds Flat Minima
by: Zhang, Liang, et al.
Published: (2025)

Fast and Effective Computation of Generalized Symmetric Matrix Factorization
by: Yang, Lei, et al.
Published: (2026)

Preconditioned Gradient Descent for Over-Parameterized Nonconvex Matrix Factorization
by: Zhang, Gavin, et al.
Published: (2025)

A Second-Order Majorant Algorithm for Nonnegative Matrix Factorization
by: Pham, Mai-Quyen, et al.
Published: (2023)

Majorization-minimization for Sparse Nonnegative Matrix Factorization with the $β$-divergence
by: Marmin, Arthur, et al.
Published: (2022)

Efficient algorithms for regularized Poisson Non-negative Matrix Factorization
by: Perraudin, Nathanaël, et al.
Published: (2024)

DLMMPR:Deep Learning-based Measurement Matrix for Phase Retrieval
by: Liu, Jing, et al.
Published: (2025)

Enhancing Accuracy in Deep Learning Using Random Matrix Theory
by: Berlyand, Leonid, et al.
Published: (2023)

Global Convergence of Four-Layer Matrix Factorization under Random Initialization
by: Luo, Minrui, et al.
Published: (2025)

Implicit Bias in Matrix Factorization and its Explicit Realization in a New Architecture
by: Hou, Yikun, et al.
Published: (2025)

Sparse Hyperparametric Itakura-Saito Nonnegative Matrix Factorization via Bi-Level Optimization
by: Selicato, Laura, et al.
Published: (2025)

Provable Acceleration of Nesterov's Accelerated Gradient for Rectangular Matrix Factorization and Linear Neural Networks
by: Xu, Zhenghao, et al.
Published: (2024)

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

Critical Influence of Overparameterization on Sharpness-aware Minimization
by: Shin, Sungbin, et al.
Published: (2023)

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

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

On the Crucial Role of Initialization for Matrix Factorization
by: Li, Bingcong, et al.
Published: (2024)

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)

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

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

Accelerated Nonnegative Tensor Completion via Integer Programming
by: Pan, Wenhao, et al.
Published: (2022)

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

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

State-Dependent Lyapunov Method for Rank-1 Matrix Factorization
by: Moon, Jaehong
Published: (2026)

Beyond $\tilde{O}(\sqrt{T})$ Constraint Violation for Online Convex Optimization with Adversarial Constraints
by: Sinha, Abhishek, et al.
Published: (2025)

MOSS: Multi-Objective Optimization for Stable Rule Sets
by: Liu, Brian, et al.
Published: (2025)

Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
by: Sinha, Abhishek, et al.
Published: (2023)

Tight Bounds for Online Convex Optimization with Adversarial Constraints
by: Sinha, Abhishek, et al.
Published: (2024)