Follow
Deepesh Data
Title
Cited by
Cited by
Year
Qsparse-local-SGD: Distributed SGD with quantization, sparsification and local computations
D Basu, D Data, C Karakus, S Diggavi
Advances in Neural Information Processing Systems 32, 2019
1792019
A field guide to federated optimization
J Wang, Z Charles, Z Xu, G Joshi, HB McMahan, M Al-Shedivat, G Andrew, ...
arXiv preprint arXiv:2107.06917, 2021
342021
Shuffled model of differential privacy in federated learning
A Girgis, D Data, S Diggavi, P Kairouz, AT Suresh
International Conference on Artificial Intelligence and Statistics, 2521-2529, 2021
302021
Shuffled model of federated learning: Privacy, accuracy and communication trade-offs
AM Girgis, D Data, S Diggavi, P Kairouz, AT Suresh
IEEE Journal on Selected Areas in Information Theory 2 (1), 464-478, 2021
27*2021
SPARQ-SGD: Event-triggered and compressed communication in decentralized stochastic optimization
N Singh, D Data, J George, S Diggavi
arXiv preprint arXiv:1910.14280, 2019
27*2019
On the communication complexity of secure computation
D Data, MM Prabhakaran, VM Prabhakaran
Annual Cryptology Conference, 199-216, 2014
242014
Squarm-sgd: Communication-efficient momentum sgd for decentralized optimization
N Singh, D Data, J George, S Diggavi
IEEE Journal on Selected Areas in Information Theory 2 (3), 954-969, 2021
202021
Communication and randomness lower bounds for secure computation
D Data, VM Prabhakaran, MM Prabhakaran
IEEE Transactions on Information Theory 62 (7), 3901-3929, 2016
192016
Data encoding for byzantine-resilient distributed optimization
D Data, L Song, SN Diggavi
IEEE Transactions on Information Theory 67 (2), 1117-1140, 2020
162020
Byzantine-Resilient High-Dimensional SGD with Local Iterations on Heterogeneous Data
D Data, S Diggavi
International Conference on Machine Learning 139, 2478-2488, 2021
14*2021
Data encoding for Byzantine-resilient distributed gradient descent
D Data, L Song, S Diggavi
2018 56th Annual Allerton Conference on Communication, Control, and …, 2018
132018
Data encoding methods for byzantine-resilient distributed optimization
D Data, L Song, S Diggavi
2019 IEEE International Symposium on Information Theory (ISIT), 2719-2723, 2019
112019
Must the communication graph of MPC protocols be an expander?
E Boyle, R Cohen, D Data, P Hubáček
Annual International Cryptology Conference, 243-272, 2018
112018
Byzantine-tolerant distributed coordinate descent
D Data, S Diggavi
2019 IEEE International Symposium on Information Theory (ISIT), 2724-2728, 2019
62019
Towards characterizing securely computable two-party randomized functions
D Data, M Prabhakaran
IACR International Workshop on Public Key Cryptography, 675-697, 2018
62018
How to securely compute the modulo-two sum of binary sources
D Data, BK Dey, M Mishra, VM Prabhakaran
2014 IEEE Information Theory Workshop (ITW 2014), 496-500, 2014
62014
Interactive secure function computation
D Data, GR Kurri, J Ravi, VM Prabhakaran
IEEE Transactions on Information Theory 66 (9), 5492-5521, 2020
42020
Secure computation of randomized functions
D Data
2016 IEEE International Symposium on Information Theory (ISIT), 3053-3057, 2016
42016
On the renyi differential privacy of the shuffle model
AM Girgis, D Data, S Diggavi, AT Suresh, P Kairouz
Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications …, 2021
32021
On byzantine-resilient high-dimensional stochastic gradient descent
D Data, S Diggavi
2020 IEEE International Symposium on Information Theory (ISIT), 2628-2633, 2020
32020
The system can't perform the operation now. Try again later.
Articles 1–20