AI RESEARCH
Stochastic Non-Smooth Convex Optimization with Unbounded Gradients
arXiv CS.LG
•
ArXi:2605.15522v1 Announce Type: cross Much of the existing theory on first-order non-smooth optimization is built on a restrictive assumption that the gradients of the objective function are uniformly bounded. We