.png){kind=icon}
Return
A variable metric proximal stochastic gradient method: An application to classification problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejco.2024.100088.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• Supervised classification problems are ubiquitous in several scientific fields. • Proximal stochastic gradient algorithms are the gold standard to solve classification problems. • Variable metric strategies help to control the variance of the stochastic gradients. • Non-monotone line search procedures allow to automatically adjust the learning rate.
Keywords:
Variable metric
Stochastic optimization
Classification problem
Deep learning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
1.7
Papers:
63
Citations:
391
Organization
View more organizations
Cited Papers
ShareSaveVariable metric forward–backward splitting with applications to monotone inclusions in duality.png)
Optimization
OAAI
OptimizationIF0
OAAIShareSaveShareSaveShareSave View more