Search papers, labs, and topics across Lattice.
1
0
1
0
Random reshuffling mirror descent, previously unanalyzable for constrained nonconvex relative smooth problems, now has proven complexity bounds thanks to a novel dual kernel conditioning regularity condition.
