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

Jung Hwan Heo

dblp:323/8144 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 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
1 paper
Efficient and distributed learning · 80% Language models and text generation · 20%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
large language model inference
0.812024
Rethinking Channel Dimensions to Isolate Outliers for Low-bit Weight Quantization of Large Language Models · ICLR 2024
Machine learning › Efficient and distributed learning › model compression › quantization
low-bit quantization
0.812024
Rethinking Channel Dimensions to Isolate Outliers for Low-bit Weight Quantization of Large Language Models · ICLR 2024
Machine learning › Efficient and distributed learning
model compression
0.812024
Rethinking Channel Dimensions to Isolate Outliers for Low-bit Weight Quantization of Large Language Models · ICLR 2024
Machine learning › Efficient and distributed learning › model compression › quantization
outlier-aware quantization
0.812024
Rethinking Channel Dimensions to Isolate Outliers for Low-bit Weight Quantization of Large Language Models · ICLR 2024
Machine learning › Efficient and distributed learning › model compression › quantization
weight quantization
0.812024
Rethinking Channel Dimensions to Isolate Outliers for Low-bit Weight Quantization of Large Language Models · ICLR 2024

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

round-to-nearest · 0.8quantization · 0.8GPTQ · 0.8
YearPublicationVenuePosition
2024 Rethinking Channel Dimensions to Isolate Outliers for Low-bit Weight Quantization of Large Language Models
abstract
Large Language Models (LLMs) have recently demonstrated a remarkable success across various tasks. However, efficiently serving LLMs has been a challenge due to its large memory bottleneck, specifically in small batch inference settings (e.g. mobile devices). Weight-only quantization can be a promising approach, but sub-4 bit quantization remains a challenge due to large-magnitude activation outliers. To mitigate the undesirable outlier effect, we first propose per-IC quantization, a simple yet effective method that creates quantization groups within each input channel (IC) rather than the conventional per-output channel (OC). Our method is motivated by the observation that activation outliers affect the input dimension of the weight matrix, so similarly grouping the weights in the IC direction can $\textit{isolate outliers to be within a group}$. We also find that activation outliers do not dictate quantization difficulty, and inherent weight sensitivities also exist. With per-IC quantization as a new outlier-friendly scheme, we then propose Adaptive Dimensions ($\textbf{AdaDim}$), a versatile quantization framework that can adapt to various weight sensitivity patterns. We demonstrate the effectiveness of AdaDim by augmenting prior methods such as Round-To-Nearest and GPTQ, showing significant improvements across various language modeling benchmarks for both base (up to $+4.7\%$ on MMLU) and instruction-tuned (up to $+10\%$ on HumanEval) LLMs.
Jung Hwan Heo, Beomseok Kwon, Byeongwook Kim, Se Jung Kwon, Dongsoo Lee
ICLR1
2022 Sparse Periodic Systolic Dataflow for Lowering Latency and Power Dissipation of Convolutional Neural Network Accelerators
abstract
This paper introduces the sparse periodic systolic (SPS) dataflow, which advances the state-of-the-art hardware accelerator for supporting lightweight neural networks. Specifically, the SPS dataflow enables a novel hardware design approach unlocked by an emergent pruning scheme, periodic pattern-based sparsity (PPS). By exploiting the regularity of PPS, our sparsity-aware compiler optimally reorders the weights and uses a simple indexing unit in hardware to create matches between the weights and activations. Through the compiler-hardware codesign, SPS dataflow enjoys higher degrees of parallelism while being free of the high indexing overhead and without model accuracy loss. Evaluated on popular benchmarks such as VGG and ResNet, the SPS dataflow and accompanying neural network compiler outperform prior work in convolutional neural network (CNN) accelerator designs targeting FPGA devices. Against other sparsity-supporting weight storage formats, SPS results in 4.49 × energy efficiency gain while lowering storage requirements by 3.67 × for total weight storage (non-pruned weights plus indexing) and 22,044 × for indexing memory.
Jung Hwan Heo, Arash Fayyazi, Amirhossein Esmaili, Massoud Pedram
ISLPED1