Search Results for author:
Found 3 papers, 2 papers with code
Differentially Private Secure Multiplication: Hiding Information in the Rubble of Noise
We consider the problem of private distributed multi-party multiplication.
Local SGD with Periodic Averaging: Tighter Analysis and Adaptive Synchronization
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.
Numerically Stable Polynomially Coded Computing
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
