Search papers, labs, and topics across Lattice.
1
0
Achieving $O(\log T)$ regret bounds in decentralized Riemannian optimization could redefine performance expectations for online learning in complex geometries.