Raj Kumar Maity
Title
Cited by
Cited by
Year
Robust gradient descent via moment encoding and LDPC codes
RK Maity, AS Rawa, A Mazumdar
2019 IEEE International Symposium on Information Theory (ISIT), 2734-2738, 2019
492019
vqsgd: Vector quantized stochastic gradient descent
V Gandikota, D Kane, RK Maity, A Mazumdar
arXiv preprint arXiv:1911.07971, 2019
192019
Communication-efficient and byzantine-robust distributed learning
A Ghosh, RK Maity, S Kadhe, A Mazumdar, K Ramchandran
2020 Information Theory and Applications Workshop (ITA), 1-28, 2020
32020
Communication efficient distributed approximate Newton method
A Ghosh, RK Maity, A Mazumdar, K Ramchandran
2020 IEEE International Symposium on Information Theory (ISIT), 2539-2544, 2020
22020
Communication Efficient and Byzantine Tolerant Distributed Learning
A Ghosh, RK Maity, S Kadhe, A Mazumdar, K Ramachandran
2020 IEEE International Symposium on Information Theory (ISIT), 2545-2550, 2020
12020
A workload-adaptive mechanism for linear queries under local differential privacy
R McKenna, RK Maity, A Mazumdar, G Miklau
arXiv preprint arXiv:2002.01582, 2020
12020
High Dimensional Discrete Integration by Hashing and Optimization
RK Maity, A Mazumdar, S Pal
12018
Estimation of Shortest Path Covariance Matrices
RK Maity, C Musco
arXiv preprint arXiv:2011.09986, 2020
2020
High Dimensional Discrete Integration over the Hypergrid
RK Maity, A Mazumdar, S Pal
Conference on Uncertainty in Artificial Intelligence, 410-419, 2020
2020
Distributed Newton Can Communicate Less and Resist Byzantine Workers
A Ghosh, RK Maity, A Mazumdar
arXiv preprint arXiv:2006.08737, 2020
2020
Shaping proto-value functions using rewards
RK Maity, C Lakshminarayanan, S Padakandla, S Bhatnagar
Proceedings of the Twenty-second European Conference on Artificial …, 2016
2016
Shaping Proto-Value Functions via Rewards
CL Narayanan, RK Maity, S Bhatnagar
arXiv preprint arXiv:1511.08589, 2015
2015
Maximum Coverage with Path Constraint
A Fariha, L Flodin, RK Maity
The system can't perform the operation now. Try again later.
Articles 1–13