Guardado en:
Detalles Bibliográficos
Autores principales: Mirzabeigi, Elmira, Rezaee, Sepehr, Parand, Kourosh
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:https://arxiv.org/abs/2507.11262
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866908450498281472
author Mirzabeigi, Elmira
Rezaee, Sepehr
Parand, Kourosh
author_facet Mirzabeigi, Elmira
Rezaee, Sepehr
Parand, Kourosh
contents Training deep neural networks, particularly in computer vision tasks, often suffers from noisy gradients and unstable convergence, which hinder performance and generalization. In this paper, we propose LyAm, a novel optimizer that integrates Adam's adaptive moment estimation with Lyapunov-based stability mechanisms. LyAm dynamically adjusts the learning rate using Lyapunov stability theory to enhance convergence robustness and mitigate training noise. We provide a rigorous theoretical framework proving the convergence guarantees of LyAm in complex, non-convex settings. Extensive experiments on like as CIFAR-10 and CIFAR-100 show that LyAm consistently outperforms state-of-the-art optimizers in terms of accuracy, convergence speed, and stability, establishing it as a strong candidate for robust deep learning optimization.
format Preprint
id arxiv_https___arxiv_org_abs_2507_11262
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle LyAm: Robust Non-Convex Optimization for Stable Learning in Noisy Environments
Mirzabeigi, Elmira
Rezaee, Sepehr
Parand, Kourosh
Machine Learning
Optimization and Control
Training deep neural networks, particularly in computer vision tasks, often suffers from noisy gradients and unstable convergence, which hinder performance and generalization. In this paper, we propose LyAm, a novel optimizer that integrates Adam's adaptive moment estimation with Lyapunov-based stability mechanisms. LyAm dynamically adjusts the learning rate using Lyapunov stability theory to enhance convergence robustness and mitigate training noise. We provide a rigorous theoretical framework proving the convergence guarantees of LyAm in complex, non-convex settings. Extensive experiments on like as CIFAR-10 and CIFAR-100 show that LyAm consistently outperforms state-of-the-art optimizers in terms of accuracy, convergence speed, and stability, establishing it as a strong candidate for robust deep learning optimization.
title LyAm: Robust Non-Convex Optimization for Stable Learning in Noisy Environments
topic Machine Learning
Optimization and Control
url https://arxiv.org/abs/2507.11262