Farzin Haddadpour

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Viveck R. Cadambe

> Home > Persons > Farzin Haddadpour

Publications

2020
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/tit/DuttaFHJCG20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/DuttaFHJCG20
Sanghamitra Dutta, Mohammad Fahim, Farzin Haddadpour, Haewon Jeong, Viveck R. Cadambe, Pulkit Grover:
On the Optimal Recovery Threshold of Coded Matrix Multiplication. IEEE Trans. Inf. Theory 66(1): 278-301 (2020)
2019
[c10]
- view
  - electronic edition @ mlr.press (open access)
  - details & citations
- export record
  dblp key:
  - conf/icml/HaddadpourKMC19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icml/HaddadpourKMC19
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]
- view
- export record
  dblp key:
  - conf/nips/HaddadpourKMC19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/nips/HaddadpourKMC19
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]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-1910-13598
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1910-13598
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)
2018
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/allerton/HaddadpourYCG18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/allerton/HaddadpourYCG18
Farzin Haddadpour, Yaoqing Yang, Viveck R. Cadambe, Pulkit Grover:
Cross-Iteration Coded Computing. Allerton 2018: 196-203
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/isit/HaddadpourC18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isit/HaddadpourC18
Farzin Haddadpour, Viveck R. Cadambe:
Codes for Distributed Finite Alphabet Matrix-Vector Multiplication. ISIT 2018: 1625-1629
[i6]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-1801-10292
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1801-10292
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]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-1806-06140
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1806-06140
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
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/allerton/FahimJHDCG17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/allerton/FahimJHDCG17
Mohammad Fahim, Haewon Jeong, Farzin Haddadpour, Sanghamitra Dutta, Viveck R. Cadambe, Pulkit Grover:
On the optimal recovery threshold of coded matrix multiplication. Allerton 2017: 1264-1270

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.