Prathamesh Mayekar

Orcid: 0000-0003-1433-7125

According to our database1, Prathamesh Mayekar authored at least 16 papers between 2015 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
Wyner-Ziv Estimators for Distributed Mean Estimation With Side Information and Optimization.
IEEE Trans. Inf. Theory, April, 2024

2023
Compression for Distributed Optimization and Timely Updates.
CoRR, 2023

Fundamental Limits of Distributed Optimization over Multiple Access Channel.
Proceedings of the IEEE Information Theory Workshop, 2023

Communication-Constrained Bandits under Additive Gaussian Noise.
Proceedings of the International Conference on Machine Learning, 2023

2022
Fundamental Limits of Over-the-Air Optimization: Are Analog Schemes Optimal?
IEEE J. Sel. Areas Inf. Theory, 2022

Wyner-Ziv compression is (almost) optimal for distributed optimization.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
RATQ: A Universal Fixed-Length Quantizer for Stochastic Optimization.
IEEE Trans. Inf. Theory, 2021

Information-constrained optimization: can adaptive processing of gradients help?
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Wyner-Ziv Estimators: Efficient Distributed Mean Estimation with Side-Information.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Optimal Source Codes for Timely Updates.
IEEE Trans. Inf. Theory, 2020

Limits on Gradient Compression for Stochastic Optimization.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Finite Precision Stochastic Optimization - Accounting for the Bias.
CoRR, 2019

2018
Optimal Lossless Source Codes for Timely Updates.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2016
Is Prevention Always Better? A Case of IT Service Management.
Proceedings of the 20th Pacific Asia Conference on Information Systems, 2016

Some algorithms for correlated bandits with non-stationary rewards: Regret bounds and applications.
Proceedings of the 3rd IKDD Conference on Data Science, 2016

2015
Performance analysis and decomposition results for some dynamic priority schemes in 2-class queues.
Proceedings of the 13th International Symposium on Modeling and Optimization in Mobile, 2015


  Loading...