default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHanlin Tang 0002
Person information
- affiliation (PhD 2021): University of Rochester, Rochester, NY, USA
Other persons with the same name
- Hanlin Tang — disambiguation page
- Hanlin Tang 0001 — Beijing Institute of Technology, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[i18]Yanke Zhou, Yiduo Li, Hanlin Tang, Maohua Li, Kan Liu, Lan Tao, Lin Qu, Yuan Yao, Xiaoxing Ma:
Full Attention Strikes Back: Transferring Full Attention into Sparse within Hundred Training Steps. CoRR abs/2605.16928 (2026)- [i17]Chao Xu, Maohua Li, Qirui Li, Yixuan Xu, Yanke Zhou, Yunhe Li, Cuifeng Shen, Hanlin Tang, Kan Liu, Tao Lan, Lin Qu, Shao-Qun Zhang:
Rethinking Cross-Layer Information Routing in Diffusion Transformers. CoRR abs/2605.20708 (2026) - [i16]Xing Cong, Hanlin Tang, Kan Liu, Lan Tao, Lin Qu, Chenhao Xie:
RT-Lynx: Putting the GEMM Sparsity In a Right Way for Diffusion Models. CoRR abs/2605.26632 (2026) - [i15]Chuheng Du, Junyi Chen, Hanlin Tang, Kan Liu, Tao Lan, Lin Qu, Chaoyue Niu, Shengzhong Liu, Guihai Chen, Fan Wu:
C2KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference. CoRR abs/2607.17715 (2026) - [i14]Maohua Li, Qirui Li, Yanke Zhou, Yiduo Li, Zhaosheng Chi, Chao Xu, Cuifeng Shen, Yixuan Xu, Hanlin Tang, Kan Liu, Tao Lan, Lin Qu, Shao-Qun Zhang:
Text Template Tokens Are Implicit Semantic Registers in Diffusion Transformers. CoRR abs/2607.19139 (2026) - 2025
- [c9]Hanlin Tang, Yang Lin, Jing Lin, Qingsen Han, Danning Ke, Shikuan Hong, Yiwu Yao, Gongyi Wang:
RazorAttention: Efficient KV Cache Compression Through Retrieval Heads. ICLR 2025 - 2024
- [i13]Hanlin Tang, Yifu Sun, Decheng Wu, Kai Liu, Jianchen Zhu, Zhanhui Kang:
EasyQuant: An Efficient Data-free Quantization Algorithm for LLMs. CoRR abs/2403.02775 (2024) - [i12]Hanlin Tang, Yang Lin, Jing Lin, Qingsen Han, Shikuan Hong, Yiwu Yao, Gongyi Wang:
RazorAttention: Efficient KV Cache Compression Through Retrieval Heads. CoRR abs/2407.15891 (2024) - 2023
- [c8]Hanlin Tang, Yifu Sun, Decheng Wu, Kai Liu, Jianchen Zhu, Zhanhui Kang:
EasyQuant: An Efficient Data-free Quantization Algorithm for LLMs. EMNLP 2023: 9119-9128 - 2022
- [c7]Conglong Li, Ammar Ahmad Awan, Hanlin Tang, Samyam Rajbhandari, Yuxiong He:
1-bit LAMB: Communication Efficient Large-Scale Large-Batch Training with LAMB's Convergence Speed. HIPC 2022: 272-281 - [i11]Hanlin Tang, Xipeng Zhang, Kai Liu, Jianchen Zhu, Zhanhui Kang:
MKQ-BERT: Quantized BERT with 4-bits Weights and Activations. CoRR abs/2203.13483 (2022) - 2021
- [c6]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 - [c5]Hanlin Tang, Yao Li, Ji Liu, Ming Yan:
ErrorCompensatedX: error compensation for variance reduced algorithms. NeurIPS 2021: 18102-18113 - [i10]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) - [i9]Conglong Li, Ammar Ahmad Awan, Hanlin Tang, Samyam Rajbhandari, Yuxiong He:
1-bit LAMB: Communication Efficient Large-Scale Large-Batch Training with LAMB's Convergence Speed. CoRR abs/2104.06069 (2021) - [i8]Hanlin Tang, Yao Li
, Ji Liu, Ming Yan:
ErrorCompensatedX: error compensation for variance reduced algorithms. CoRR abs/2108.02102 (2021) - [i7]Weicong Ding, Hanlin Tang, Jingshuo Feng, Lei Yuan, Sen Yang, Guangxu Yang, Jie Zheng, Jing Wang, Qiang Su, Dong Zheng, Xuezhong Qiu, Yongqi Liu, Yuxuan Chen, Yang Liu, Chao Song, Dongying Kong, Kai Ren, Peng Jiang, Qiao Lian, Ji Liu:
PASTO: Strategic Parameter Optimization in Recommendation Systems - Probabilistic is Better than Deterministic. CoRR abs/2108.09076 (2021) - 2020
- [i6]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)
2010 – 2019
- 2019
- [c4]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 - [c3]Chen Yu, Hanlin Tang, Cédric Renggli, Simon Kassing, Ankit Singla, Dan Alistarh, Ce Zhang, Ji Liu:
Distributed Learning over Unreliable Networks. ICML 2019: 7202-7212 - [i5]Hanlin Tang, Xiangru Lian, Tong Zhang, Ji Liu:
DoubleSqueeze: Parallel Stochastic Gradient Descent with Double-Pass Error-Compensated Compression. CoRR abs/1905.05957 (2019) - [i4]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) - [i3]Chaoyang He, Conghui Tan, Hanlin Tang, Shuang Qiu, Ji Liu:
Central Server Free Federated Learning over Single-sided Trust Social Networks. CoRR abs/1910.04956 (2019) - 2018
- [c2]Hanlin Tang, Xiangru Lian, Ming Yan, Ce Zhang, Ji Liu:
D2: Decentralized Training over Decentralized Data. ICML 2018: 4855-4863 - [c1]Hanlin Tang, Shaoduo Gan, Ce Zhang, Tong Zhang, Ji Liu:
Communication Compression for Decentralized Training. NeurIPS 2018: 7663-7673 - [i2]Hanlin Tang, Xiangru Lian, Ming Yan, Ce Zhang, Ji Liu:
D2: Decentralized Training over Decentralized Data. CoRR abs/1803.07068 (2018) - [i1]Hanlin Tang, Chen Yu, Cédric Renggli, Simon Kassing, Ankit Singla, Dan Alistarh, Ji Liu, Ce Zhang:
Distributed Learning over Unreliable Networks. CoRR abs/1810.07766 (2018)
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 2026-08-25 23:47 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
