| On the optimal recovery threshold of coded matrix multiplication S Dutta, M Fahim, F Haddadpour, H Jeong, V Cadambe, P Grover IEEE Transactions on Information Theory 66 (1), 278-301, 2019 | 184 | 2019 |
| On the convergence of local descent methods in federated learning F Haddadpour, M Mahdavi arXiv preprint arXiv:1910.14425, 2019 | 124 | 2019 |
| Local sgd with periodic averaging: Tighter analysis and adaptive synchronization F Haddadpour, MM Kamani, M Mahdavi, V Cadambe Advances in Neural Information Processing Systems 32, 2019 | 116 | 2019 |
| Federated learning with compression: Unified analysis and sharp guarantees F Haddadpour, MM Kamani, A Mokhtari, M Mahdavi International Conference on Artificial Intelligence and Statistics, 2350-2358, 2021 | 84 | 2021 |
| On the optimal recovery threshold of coded matrix multiplication M Fahim, H Jeong, F Haddadpour, S Dutta, V Cadambe, P Grover 2017 55th Annual Allerton Conference on Communication, Control, and …, 2017 | 75 | 2017 |
| Trading redundancy for communication: Speeding up distributed SGD for non-convex optimization F Haddadpour, MM Kamani, M Mahdavi, V Cadambe International Conference on Machine Learning, 2545-2554, 2019 | 55 | 2019 |
| Coordination via a relay F Haddadpour, MH Yassaee, A Gohari, MR Aref 2012 IEEE International Symposium on Information Theory Proceedings, 3048-3052, 2012 | 29 | 2012 |
| Codes for distributed finite alphabet matrix-vector multiplication F Haddadpour, VR Cadambe 2018 IEEE International Symposium on Information Theory (ISIT), 1625-1629, 2018 | 25 | 2018 |
| Straggler-resilient and communication-efficient distributed iterative linear solver F Haddadpour, Y Yang, M Chaudhari, VR Cadambe, P Grover arXiv preprint arXiv:1806.06140, 2018 | 21 | 2018 |
| Simulation of a channel with another channel F Haddadpour, MH Yassaee, S Beigi, A Gohari, MR Aref IEEE Transactions on Information Theory 63 (5), 2659-2677, 2016 | 21 | 2016 |
| Cross-iteration coded computing F Haddadpour, Y Yang, V Cadambe, P Grover 2018 56th Annual Allerton Conference on Communication, Control, and …, 2018 | 17 | 2018 |
| Efficient fair principal component analysis MM Kamani, F Haddadpour, R Forsati, M Mahdavi Machine Learning, 1-32, 2022 | 11 | 2022 |
| Fedsketch: Communication-efficient and private federated learning via sketching F Haddadpour, B Karimi, P Li, X Li arXiv preprint arXiv:2008.04975, 2020 | 9 | 2020 |
| When is it possible to simulate a DMC channel from another? F Haddadpour, MH Yassaee, MR Aref, A Gohari 2013 IEEE Information Theory Workshop (ITW), 1-5, 2013 | 8 | 2013 |
| On AVCs with quadratic constraints F Haddadpour, MJ Siavoshani, M Bakshi, S Jaggi 2013 IEEE International Symposium on Information Theory, 271-275, 2013 | 6 | 2013 |
| Low-complexity stochastic generalized belief propagation F Haddadpour, MJ Siavoshani, M Noshad 2016 IEEE International Symposium on Information Theory (ISIT), 785-789, 2016 | 3 | 2016 |
| Beyond Lipschitz: Sharp Generalization and Excess Risk Bounds for Full-Batch GD KE Nikolakakis, F Haddadpour, A Karbasi, DS Kalogerias arXiv preprint arXiv:2204.12446, 2022 | | 2022 |
| Learning Distributionally Robust Models at Scale via Composite Optimization F Haddadpour, MM Kamani, M Mahdavi, A Karbasi International Conference on Learning Representations, 2022 | | 2022 |
| Black-Box Generalization KE Nikolakakis, F Haddadpour, DS Kalogerias, A Karbasi arXiv preprint arXiv:2202.06880, 2022 | | 2022 |
| Communication-Efficient and Fault-Tolerant Algorithms for Distributed Machine Learning F Haddadpour The Pennsylvania State University, 2021 | | 2021 |
Mehrdad MahdaviAssistant Professor of Computer Science, Pennsylvania State UniversityVerified email at psu.edu
