Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hanzhen Zhao

dblp:357/4984 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Optimization for machine learning · 50% Efficient and distributed learning · 25% Language models and text generation · 25%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › distributed training
gradient compression
0.912025
SEPARATE: A Simple Low-rank Projection for Gradient Compression in Modern Large-scale Model Training Process · ICLR 2025
Natural language and speech › Language models and text generation
large language model fine-tuning
0.912025
PaZO: Preconditioned Accelerated Zeroth-Order Optimization for Fine-Tuning LLMs · NeurIPS 2025
Machine learning › Optimization for machine learning › black-box optimization
zeroth-order optimization
0.912025
PaZO: Preconditioned Accelerated Zeroth-Order Optimization for Fine-Tuning LLMs · NeurIPS 2025
Distributed systems › distributed machine learning › distributed training
communication-efficient distributed training
0.912025
SEPARATE: A Simple Low-rank Projection for Gradient Compression in Modern Large-scale Model Training Process · ICLR 2025
Distributed systems › distributed machine learning
distributed training
0.912025
SEPARATE: A Simple Low-rank Projection for Gradient Compression in Modern Large-scale Model Training Process · ICLR 2025

Methods — techniques the papers use, named apart from their topics

low-rank projection · 1.7error feedback · 1.7adam · 1.7SGD · 1.7zeroth-order stochastic gradient descent · 0.9simultaneous perturbation stochastic approximation · 0.9diagonal hessian estimation · 0.9
YearPublicationVenuePosition
2025 SEPARATE: A Simple Low-rank Projection for Gradient Compression in Modern Large-scale Model Training Process
abstract
Training Large Language Models (LLMs) presents a significant communication bottleneck, predominantly due to the growing scale of the gradient to communicate across multi-device clusters. However, how to mitigate communication overhead in practice remains a formidable challenge due to the weakness of the methodology of the existing compression methods, especially the neglect of the characteristics of the gradient. In this paper, we consider and demonstrate the low-rank properties of gradient and Hessian observed in LLMs training dynamic, and take advantage of such natural properties to design SEPARATE, a simple low-rank projection for gradient compression in modern large-scale model training processes. SEPARATE realizes dimensional reduction by common random Gaussian variables and an improved moving average error-feedback technique. We theoretically demonstrate that SEPARATE-based optimizers maintain the original convergence rate for SGD and Adam-Type optimizers for general non-convex objectives. Experimental results show that SEPARATE accelerates training speed by up to 2× for GPT-2-Medium pre-training, and improves performance on various benchmarks for LLAMA2-7B fine-tuning.
Hanzhen Zhao, Xingyu Xie, Cong Fang 0001, Zhouchen Lin
ICLR1
2025 PaZO: Preconditioned Accelerated Zeroth-Order Optimization for Fine-Tuning LLMs
abstract
This paper introduces PaZO, a preconditioned accelerated zeroth-order optimization algorithm for fine-tuning large language models (LLMs). First, we theoretically demonstrate the necessity of preconditioning in zeroth-order optimization, proving that zeroth-order stochastic gradient descent (ZO-SGD) alone fails to achieve the ideal convergence rate. Building on this, we propose a Preconditioned Simultaneous Perturbation Stochastic Approximation (PSPSA) and theoretical version of PaZO, and demonstrate that setting the order of preconditioner as $-1/2$ in PSPSA yields the improved convergence rate for PaZO. Moreover, we design a practical version of PaZO that stabilizes training via diagonal Hessian estimate and moving average technique. Extensive experiments on diverse downstream tasks with models like RoBERTa-large and OPT show PaZO’s effectiveness. Compared to other zeroth-order baselines, PaZO achieves better performance across models and tasks.
Hanzhen Zhao, Shihong Ding, Cong Fang 0001, Zhouchen Lin
NeurIPS1