research
∙
03/17/2021
Escaping Saddle Points in Distributed Newton's Method with Communication efficiency and Byzantine Resilience
We study the problem of optimizing a non-convex loss function (with sadd...
share
research
∙
11/19/2020
Estimation of Shortest Path Covariance Matrices
We study the sample complexity of estimating the covariance matrix Σ∈ℝ^d...
research
∙
06/15/2020
Distributed Newton Can Communicate Less and Resist Byzantine Workers
We develop a distributed second order optimization algorithm that is com...
research
∙
02/05/2020
A workload-adaptive mechanism for linear queries under local differential privacy
We propose a new mechanism to accurately answer a user-provided set of l...
research
∙
11/21/2019
Communication-Efficient and Byzantine-Robust Distributed Learning
We develop a communication-efficient distributed learning algorithm that...
research
∙
11/18/2019
vqSGD: Vector Quantized Stochastic Gradient Descent
In this work, we present a family of vector quantization schemes vqSGD (...
research
∙
06/29/2018
High Dimensional Discrete Integration by Hashing and Optimization
Recently Ermon et al. (2013) pioneered an ingenuous way to practically c...
research
∙
05/22/2018
Robust Gradient Descent via Moment Encoding with LDPC Codes
This paper considers the problem of implementing large-scale gradient de...
research
∙
11/27/2015
