Hanlin Tang

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 Xiangru Lian

> Home > Persons > Hanlin Tang

Publications

2021
[c21]
- view
  - electronic edition @ mlr.press (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/icml/TangGARLLLZH21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icml/TangGARLLLZH21
Hanlin Tang, Shaoduo Gan, Ammar Ahmad Awan, Samyam Rajbhandari, Conglong Li, Xiangru Lian, Ji Liu, Ce Zhang, Yuxiong He:
1-bit Adam: Communication Efficient Large-Scale Training with Adam's Convergence Speed. ICML 2021: 10118-10129
[i28]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2102-02888
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2102-02888
Hanlin Tang, Shaoduo Gan, Ammar Ahmad Awan, Samyam Rajbhandari, Conglong Li, Xiangru Lian, Ji Liu, Ce Zhang, Yuxiong He:
1-bit Adam: Communication Efficient Large-Scale Training with Adam's Convergence Speed. CoRR abs/2102.02888 (2021)
2020
[i18]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2008-11343
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2008-11343
Hanlin Tang, Shaoduo Gan, Samyam Rajbhandari, Xiangru Lian, Ji Liu, Yuxiong He, Ce Zhang:
APMSqueeze: A Communication Efficient Adam-Preconditioned Momentum SGD Algorithm. CoRR abs/2008.11343 (2020)
2019
[c7]
- view
  - electronic edition @ mlr.press (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/icml/TangYLZL19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icml/TangYLZL19
Hanlin Tang, Chen Yu, Xiangru Lian, Tong Zhang, Ji Liu:
DoubleSqueeze: Parallel Stochastic Gradient Descent with Double-pass Error-Compensated Compression. ICML 2019: 6155-6165
[i14]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1905-05957
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1905-05957
Hanlin Tang, Xiangru Lian, Tong Zhang, Ji Liu:
DoubleSqueeze: Parallel Stochastic Gradient Descent with Double-Pass Error-Compensated Compression. CoRR abs/1905.05957 (2019)
[i11]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1907-07346
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1907-07346
Hanlin Tang, Xiangru Lian, Shuang Qiu, Lei Yuan, Ce Zhang, Tong Zhang, Ji Liu:
DeepSqueeze: Parallel Stochastic Gradient Descent with Double-Pass Error-Compensated Compression. CoRR abs/1907.07346 (2019)
2018
[c3]
- view
  - electronic edition @ mlr.press (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/icml/TangLYZL18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icml/TangLYZL18
Hanlin Tang, Xiangru Lian, Ming Yan, Ce Zhang, Ji Liu:
D²: Decentralized Training over Decentralized Data. ICML 2018: 4855-4863
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1803-07068
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1803-07068
Hanlin Tang, Xiangru Lian, Ming Yan, Ce Zhang, Ji Liu:
D²: Decentralized Training over Decentralized Data. CoRR abs/1803.07068 (2018)

a service of

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.