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

Jeongin Bae

dblp:330/9924 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 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 since 2021Systems, architecture and hardware · 1 · 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
2 papers
Efficient and distributed learning · 94% Language models and text generation · 6%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
model compression
1.722025
FIGLUT: An Energy-Efficient Accelerator Design for FP-INT GEMM Using Look-Up Tables · HPCA 2025
Unifying Uniform and Binary-coding Quantization for Accurate Compression of Large Language Models · ACL (1) 2025
Machine learning › Efficient and distributed learning › model compression › quantization
binary quantization
0.912025
Unifying Uniform and Binary-coding Quantization for Accurate Compression of Large Language Models · ACL (1) 2025
Machine learning › Efficient and distributed learning › model compression
quantization
0.912025
Unifying Uniform and Binary-coding Quantization for Accurate Compression of Large Language Models · ACL (1) 2025
Machine learning › Efficient and distributed learning › model compression › quantization › weight quantization
weight-only quantization
0.912025
FIGLUT: An Energy-Efficient Accelerator Design for FP-INT GEMM Using Look-Up Tables · HPCA 2025
Hardware accelerators and domain-specific architectures › sparse matrix multiplication accelerator
matrix multiplication accelerator
0.912025
FIGLUT: An Energy-Efficient Accelerator Design for FP-INT GEMM Using Look-Up Tables · HPCA 2025
Natural language and speech › Language models and text generation
large language model inference
0.312025
FIGLUT: An Energy-Efficient Accelerator Design for FP-INT GEMM Using Look-Up Tables · HPCA 2025

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

lookup table · 1.7half-size LUT · 1.7decoding and multiplexing · 1.7quantization · 0.9
YearPublicationVenuePosition
2025 Unifying Uniform and Binary-coding Quantization for Accurate Compression of Large Language Models
abstract
Seungcheol Park, Jeongin Bae, Beomseok Kwon, Minjun Kim, Byeongwook Kim, Se Jung Kwon, U Kang, Dongsoo Lee. Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2025.
Seungcheol Park, Jeongin Bae, Beomseok Kwon, Minjun Kim 0010, Byeongwook Kim, Se Jung Kwon, U Kang, Dongsoo Lee
ACL (1)2
2025 FIGLUT: An Energy-Efficient Accelerator Design for FP-INT GEMM Using Look-Up Tables
abstract
Weight-only quantization has emerged as a promising solution to the deployment challenges of large language models (LLMs). However, it necessitates FP-INT operations, which make implementation on general-purpose hardware like GPUs difficult. In this paper, we propose FIGLUT, an efficient look-up table (LUT)-based GEMM accelerator architecture. Instead of performing traditional arithmetic operations, FIGLUT retrieves precomputed values from an LUT based on weight patterns, significantly reducing the computational complexity. We also introduce a novel LUT design that addresses the limitations of conventional memory architectures. To further improve LUT-based operations, we propose a half-size LUT combined with a dedicated decoding and multiplexing unit. FIGLUT efficiently supports different bit precisions and quantization methods using a single fixed hardware configuration. For the same 3-bit weight precision, FIGLUT demonstrates 59% higher TOPS/W and 20% lower perplexity than state-of-the-art accelerator design. When targeting the same perplexity, FIGLUT achieves $98 \%$ higher TOPS/W by performing 2.4-bit operations.
Gunho Park, Hyeokjun Kwon, Jeongin Bae, Baeseong Park, Dongsoo Lee
HPCA4
2025 CodeGEMM: A Codebook-Centric Approach to Efficient GEMM in Quantized LLMs
abstract
Weight-only quantization is widely used to mitigate the memory-bound nature of LLM inference. Codebook-based methods extend this trend by achieving strong accuracy in the extremely low-bit regime (e.g., 2-bit). However, current kernels rely on dequantization, which repeatedly fetches centroids and reconstructs weights, incurring substantial latency and cache pressure. We present CodeGEMM, a codebook-centric GEMM kernel that replaces dequantization with precomputed inner products between centroids and activations stored in a lightweight Psumbook. At inference, code indices directly gather these partial sums, eliminating per-element lookups and reducing the on-chip footprint. The kernel supports the systematic exploration of latency–memory–accuracy trade-offs under a unified implementation. On Llama-3 models, CodeGEMM delivers 1.83x (8B) and 8.93x (70B) speedups in the 2-bit configuration compared to state-of-the-art codebook-based quantization at comparable accuracy and further improves computing efficiency and memory subsystem utilization.
Gunho Park, Jeongin Bae, Byeongwook Kim, Baeseong Park, Jiwon Ryu, Hoseung Kim, Se Jung Kwon, Dongsoo Lee
NeurIPS2