default search action
Farzin Haddadpour
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c14]Konstantinos E. Nikolakakis, Farzin Haddadpour, Amin Karbasi, Dionysios S. Kalogerias:
Beyond Lipschitz: Sharp Generalization and Excess Risk Bounds for Full-Batch GD. ICLR 2023 - 2022
- [j3]Mohammad Mahdi Kamani
, Farzin Haddadpour, Rana Forsati, Mehrdad Mahdavi:
Efficient fair principal component analysis. Mach. Learn. 111(10): 3671-3702 (2022) - [c13]Farzin Haddadpour, Mohammad Mahdi Kamani, Mehrdad Mahdavi, Amin Karbasi:
Learning Distributionally Robust Models at Scale via Composite Optimization. ICLR 2022 - [c12]Konstantinos E. Nikolakakis, Farzin Haddadpour, Dionysios S. Kalogerias, Amin Karbasi:
Black-Box Generalization: Stability of Zeroth-Order Learning. NeurIPS 2022 - [i14]Konstantinos E. Nikolakakis, Farzin Haddadpour, Dionysios S. Kalogerias, Amin Karbasi:
Black-Box Generalization. CoRR abs/2202.06880 (2022) - [i13]Farzin Haddadpour, Mohammad Mahdi Kamani, Mehrdad Mahdavi, Amin Karbasi:
Learning Distributionally Robust Models at Scale via Composite Optimization. CoRR abs/2203.09607 (2022) - [i12]Konstantinos E. Nikolakakis, Farzin Haddadpour, Amin Karbasi, Dionysios S. Kalogerias
Beyond Lipschitz: Sharp Generalization and Excess Risk Bounds for Full-Batch GD. CoRR abs/2204.12446 (2022) - 2021
- [c11]Farzin Haddadpour, Mohammad Mahdi Kamani, Aryan Mokhtari, Mehrdad Mahdavi:
Federated Learning with Compression: Unified Analysis and Sharp Guarantees. AISTATS 2021: 2350-2358 - 2020
- [j2]Sanghamitra Dutta
On the Optimal Recovery Threshold of Coded Matrix Multiplication. IEEE Trans. Inf. Theory 66(1): 278-301 (2020) - [i11]Farzin Haddadpour, Mohammad Mahdi Kamani, Aryan Mokhtari, Mehrdad Mahdavi:
Federated Learning with Compression: Unified Analysis and Sharp Guarantees. CoRR abs/2007.01154 (2020) - [i10]Farzin Haddadpour, Belhal Karimi, Ping Li, Xiaoyun Li:
FedSKETCH: Communication-Efficient and Private Federated Learning via Sketching. CoRR abs/2008.04975 (2020)
2010 – 2019
- 2019
- [c10]Farzin Haddadpour, Mohammad Mahdi Kamani, Mehrdad Mahdavi, Viveck R. Cadambe:
Trading Redundancy for Communication: Speeding up Distributed SGD for Non-convex Optimization. ICML 2019: 2545-2554 - [c9]Farzin Haddadpour, Mohammad Mahdi Kamani, Mehrdad Mahdavi, Viveck R. Cadambe:
Local SGD with Periodic Averaging: Tighter Analysis and Adaptive Synchronization. NeurIPS 2019: 11080-11092 - [i9]Farzin Haddadpour, Mohammad Mahdi Kamani, Mehrdad Mahdavi, Viveck R. Cadambe:
Local SGD with Periodic Averaging: Tighter Analysis and Adaptive Synchronization. CoRR abs/1910.13598 (2019) - [i8]Farzin Haddadpour, Mehrdad Mahdavi:
On the Convergence of Local Descent Methods in Federated Learning. CoRR abs/1910.14425 (2019) - [i7]Mohammad Mahdi Kamani, Farzin Haddadpour, Rana Forsati, Mehrdad Mahdavi:
Efficient Fair Principal Component Analysis. CoRR abs/1911.04931 (2019) - 2018
- [c8]Farzin Haddadpour, Yaoqing Yang, Viveck R. Cadambe
Cross-Iteration Coded Computing. Allerton 2018: 196-203 - [c7]Farzin Haddadpour, Viveck R. Cadambe
Codes for Distributed Finite Alphabet Matrix-Vector Multiplication. ISIT 2018: 1625-1629 - [i6]Sanghamitra Dutta, Mohammad Fahim, Farzin Haddadpour, Haewon Jeong, Viveck R. Cadambe, Pulkit Grover
On the Optimal Recovery Threshold of Coded Matrix Multiplication. CoRR abs/1801.10292 (2018) - [i5]Farzin Haddadpour, Yaoqing Yang, Malhar Chaudhari, Viveck R. Cadambe, Pulkit Grover
Straggler-Resilient and Communication-Efficient Distributed Iterative Linear Solver. CoRR abs/1806.06140 (2018) - 2017
- [j1]Farzin Haddadpour
Simulation of a Channel With Another Channel. IEEE Trans. Inf. Theory 63(5): 2659-2677 (2017) - [c6]Mohammad Fahim, Haewon Jeong
On the optimal recovery threshold of coded matrix multiplication. Allerton 2017: 1264-1270 - 2016
- [c5]Farzin Haddadpour, Mahdi Jafari Siavoshani, Morteza Noshad:
Low-complexity stochastic Generalized Belief Propagation. ISIT 2016: 785-789 - [i4]Farzin Haddadpour, Mahdi Jafari Siavoshani, Morteza Noshad:
Low-Complexity Stochastic Generalized Belief Propagation. CoRR abs/1605.02046 (2016) - 2013
- [c4]Farzin Haddadpour, Mahdi Jafari Siavoshani, Mayank Bakshi
On AVCs with quadratic constraints. ISIT 2013: 271-275 - [c3]Farzin Haddadpour, Mohammad Hossein Yassaee, Mohammad Reza Aref, Amin Gohari
When is it possible to simulate a DMC channel from another? ITW 2013: 1-5 - [c2]Farzin Haddadpour, Ehsan Gholami, Seyed Hamed Rastegar, Hamid Behroozi:
Finite-SNR diversity-multiplexing tradeoff in multi-relay channels. IWCIT 2013: 1-6 - [i3]Farzin Haddadpour, Mahdi Jafari Siavoshani, Mayank Bakshi, Sidharth Jaggi:
On AVCs with Quadratic Constraints. CoRR abs/1301.6345 (2013) - [i2]Farzin Haddadpour, Mohammad Hossein Yassaee, Mohammad Reza Aref, Amin Gohari:
When is it possible to simulate a DMC channel from another? CoRR abs/1305.5901 (2013) - 2012
- [c1]Farzin Haddadpour, Mohammad Hossein Yassaee, Amin Gohari
Coordination via a relay. ISIT 2012: 3048-3052 - [i1]Farzin Haddadpour, Mohammad Hossein Yassaee, Amin Gohari, Mohammad Reza Aref:
Coordination via a relay. CoRR abs/1203.0731 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: