Search papers, labs, and topics across Lattice.
Note:
1
0
1
1
Optimal oracle complexity for nonsmooth nonconvex composite optimization is finally achieved, matching noncomposite rates by cleverly incorporating the convex regularizer into online learning losses.
