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

Hojoon Kim

dblp:216/1184 · 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 · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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 · 93% Language models and text generation · 7%
Computer graphics and multimedia
1 paper
Multimedia systems and quality of experience · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
inference acceleration
0.912025
Déjà Vu: Efficient Video-Language Query Engine with Learning-based Inter-Frame Computation Reuse · Proc. VLDB Endow. 2025
Machine learning › Efficient and distributed learning › model compression › quantization
low-bit quantization
0.912025
DecDEC: A Systems Approach to Advancing Low-Bit LLM Quantization · OSDI 2025
Machine learning › Efficient and distributed learning
model compression
0.912025
DecDEC: A Systems Approach to Advancing Low-Bit LLM Quantization · OSDI 2025
Machine learning › Efficient and distributed learning › model compression
quantization
0.912025
DecDEC: A Systems Approach to Advancing Low-Bit LLM Quantization · OSDI 2025
Hardware accelerators and domain-specific architectures
machine learning accelerator
0.912025
FlashTP: Fused, Sparsity-Aware Tensor Product for Machine Learning Interatomic Potentials · ICML 2025
Natural language and speech › Language models and text generation
large language model inference
0.312025
DecDEC: A Systems Approach to Advancing Low-Bit LLM Quantization · OSDI 2025
Computational science and engineering › model simulation › atomistic simulation
machine learning interatomic potential
0.312025
FlashTP: Fused, Sparsity-Aware Tensor Product for Machine Learning Interatomic Potentials · ICML 2025
Computational science and engineering › computational chemistry › molecular simulation
molecular dynamics
0.312025
FlashTP: Fused, Sparsity-Aware Tensor Product for Machine Learning Interatomic Potentials · ICML 2025

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

vision transformer · 1.7sparse computation · 1.7memory-compute joint compaction · 1.7learning-based reuse detection · 1.7kernel fusion · 1.7
YearPublicationVenuePosition
2025 FlashTP: Fused, Sparsity-Aware Tensor Product for Machine Learning Interatomic Potentials
abstract
Machine Learning Interatomic Potentials (MLIPs) enable efficient molecular dynamics (MD) simulations with high accuracy. While equivariant MLIPs achieve state-of-the-art accuracy, they face significant computational bottlenecks centered around their Tensor-Product layer, which account for up to 75% of training time and cause substantial memory overhead. We present FlashTP, a highly optimized tensor-product library that addresses these inefficiencies through kernel fusion, sparse computation, and path-aggregated execution. FlashTP achieves up to 41.6$\times$ and 60.8$\times$ kernel speedups over e3nn and NVIDIA cuEquivariance, respectively. For SevenNet-l3i5, it delivers 4.2$\times$ and 3.5$\times$ speedup while reducing peak memory usage by 6.3$\times$ and 6.2$\times$ for inference and training, respectively. The code is available at https://github.com/SNU-ARC/flashTP.
Seung Yul Lee, Hojoon Kim, Yutack Park, Seungwu Han, Yeonhong Park, Jae W. Lee
ICML2
2025 DecDEC: A Systems Approach to Advancing Low-Bit LLM Quantization
Yeonhong Park, Jake Hyun, Hojoon Kim, Jae W. Lee
OSDI3
2025 Déjà Vu: Efficient Video-Language Query Engine with Learning-based Inter-Frame Computation Reuse
abstract
Recently, Video-Language Models (VideoLMs) have demonstrated remarkable capabilities, offering significant potential for flexible and powerful video query systems. These models typically rely on Vision Transformers (ViTs), which process video frames individually to extract visual embeddings. However, generating embeddings for large-scale videos requires ViT inferencing across numerous frames, posing a major hurdle to real-world deployment and necessitating solutions for integration into scalable video data management systems. This paper introduces Déjà Vu, a video-language query engine that accelerates ViT-based VideoLMs by reusing computations across consecutive frames. At its core is ReuseViT, a modified ViT model specifically designed for VideoLM tasks, which learns to detect inter-frame reuse opportunities, striking an effective balance between accuracy and reuse. Although ReuseViT significantly reduces computation, these savings do not directly translate into performance gains on GPUs. To overcome this, Déjà Vu integrates memory-compute joint compaction techniques that convert the FLOP savings into tangible performance gains. Evaluations on three VideoLM tasks show that Déjà Vu accelerates embedding generation by up to a 2.64× within a 2% error bound, dramatically enhancing the practicality of VideoLMs for large-scale video analytics.
Jinwoo Hwang, Yoonsung Kim, Guseul Heo, Hojoon Kim, Yunseok Jeong, Tadiwos Meaza, Eunhyeok Park, Jeongseob Ahn, Jongse Park
Proc. VLDB Endow.6