Revisiting optimal convergence rate for smooth and non-convex stochastic decentralized optimization
While numerous effective decentralized algorithms have been proposed with theoretical
guarantees and empirical successes, the performance limits in decentralized optimization …
guarantees and empirical successes, the performance limits in decentralized optimization …
Lower bounds and nearly optimal algorithms in distributed learning with communication compression
Recent advances in distributed optimization and learning have shown that communication
compression is one of the most effective means of reducing communication. While there …
compression is one of the most effective means of reducing communication. While there …
Nearly tight bounds for discrete search under outlier noise
Binary search is one of the most fundamental search routines, exploiting the hidden
structure of the search space. In particular, it cuts down exponentially on the complexity of …
structure of the search space. In particular, it cuts down exponentially on the complexity of …