most citedAdapprox: Adaptive Approximation in Adam Optimization via Randomized Low-Rank Matrices

2 citations · 2 across the 5 of their papers we have counts for

collaborators

5 papers

cs.LG2025

SPAP: Structured Pruning via Alternating Optimization and Penalty Methods

Hanyu Hu, Xiaoming Yuan

The deployment of large language models (LLMs) is often constrained by their substantial computational and memory demands. While structured pruning presents a viable approach by el…

cs.LG2025

FASP: Fast and Accurate Structured Pruning of Large Language Models

Hanyu Hu, Pengxiang Zhao, Ping Li +3

The rapid increase in the size of large language models (LLMs) has significantly escalated their computational and memory demands, posing challenges for efficient deployment, espec…

cs.LG2025

GANQ: GPU-Adaptive Non-Uniform Quantization for Large Language Models

Pengxiang Zhao, Xiaoming Yuan

Large Language Models (LLMs) face significant deployment challenges due to their substantial resource requirements. While low-bit quantized weights can reduce memory usage and impr…

cs.LG2024

A Convex-optimization-based Layer-wise Post-training Pruner for Large Language Models

Pengxiang Zhao, Hanyu Hu, Ping Li +3

Pruning is a critical strategy for compressing trained large language models (LLMs), aiming at substantial memory conservation and computational acceleration without compromising p…

cs.LG2024★ 2 cited

Adapprox: Adaptive Approximation in Adam Optimization via Randomized Low-Rank Matrices

Pengxiang Zhao, Ping Li, Yingjie Gu +4

As deep learning models exponentially increase in size, optimizers such as Adam encounter significant memory consumption challenges due to the storage of first and second moment da…