no code implementations • 28 Sep 2023 • Viveck R. Cadambe, Ateet Devulapalli, Haewon Jeong, Flavio P. Calmon
We consider the problem of private distributed multi-party multiplication.
2 code implementations • NeurIPS 2019 • Farzin Haddadpour, Mohammad Mahdi Kamani, Mehrdad Mahdavi, Viveck R. Cadambe
Specifically, we show that for loss functions that satisfy the Polyak-{\L}ojasiewicz condition, $O((pT)^{1/3})$ rounds of communication suffice to achieve a linear speed up, that is, an error of $O(1/pT)$, where $T$ is the total number of model updates at each worker.
1 code implementation • 20 Mar 2019 • Mohammad Fahim, Viveck R. Cadambe
3) By specializing our orthogonal polynomial based constructions to Chebyshev polynomials, and using our condition number bound for Chebyshev-Vandermonde matrices, we construct new numerically stable techniques for coded matrix multiplication.
Information Theory Information Theory