AI RESEARCH
Theoretical Analysis of Sparse Optimization with Reparameterization, Weight Decay, and Adaptive Learning Rate
arXiv CS.AI
•
ArXi:2605.25134v1 Announce Type: cross Sparse optimization is a fundamental challenge in various practical applications. A popular approach to sparse optimization is $\ell_p$ regularization. However, it may encounter optimization instability due to the unbounded gradients when $0 <1$. In this paper, we