Rajarshi Saha

Orcid: 0000-0002-7863-9811

According to our database1, Rajarshi Saha authored at least 16 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Robust Semi-Decentralized Federated Learning via Collaborative Relaying.
IEEE Trans. Wirel. Commun., July, 2024

Privacy Preserving Semi-Decentralized Mean Estimation over Intermittently-Connected Networks.
CoRR, 2024

Compressing Large Language Models using Low Rank and Low Precision Decomposition.
CoRR, 2024

2023
Matrix Compression via Randomized Low Rank and Low Precision Factorization.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Collaborative Mean Estimation over Intermittently Connected Networks with Peer-To-Peer Privacy.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Low Precision Representations for High Dimensional Models.
Proceedings of the IEEE International Conference on Acoustics, 2023

2022
Efficient Randomized Subspace Embeddings for Distributed Optimization Under a Communication Budget.
IEEE J. Sel. Areas Inf. Theory, 2022

Decentralized Optimization Over Noisy, Rate-Constrained Networks: Achieving Consensus by Communicating Differences.
IEEE J. Sel. Areas Commun., 2022

Robust Federated Learning with Connectivity Failures: A Semi-Decentralized Framework with Collaborative Relaying.
CoRR, 2022

Minimax Optimal Quantization of Linear Models: Information-Theoretic Limits and Efficient Algorithms.
CoRR, 2022

Semi-Decentralized Federated Learning with Collaborative Relaying.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Partner-Aware Algorithms in Decentralized Cooperative Bandit Teams.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Distributed Learning and Democratic Embeddings: Polynomial-Time Source Coding Schemes Can Achieve Minimax Lower Bounds for Distributed Gradient Descent under Communication Constraints.
CoRR, 2021

Decentralized Optimization Over Noisy, Rate-Constrained Networks: How We Agree By Talking About How We Disagree.
Proceedings of the IEEE International Conference on Acoustics, 2021

2019
Pushing the Range Limits of Commercial Passive RFIDs.
Proceedings of the 16th USENIX Symposium on Networked Systems Design and Implementation, 2019

2018
Sparsity Aware Fast Block LMS Algorithms for MIMO Radar Imaging.
Proceedings of the 2018 IEEE International Workshop on Signal Processing Systems, 2018


  Loading...