1 citations · 2 across the 16 of their papers we have counts for
17 papers
CamoDocs: A Poisoning Attack Against Retrieval-Augmented Language Models Using Camouflaged Documents
Jaewon Jung, Haizhong Zheng, Hongsun Jang +3
Retrieval-augmented generation (RAG) augments LLMs with external documents, but public or user-editable sources expose RAG systems to data poisoning: attackers can inject malicious…
Moebius: Serving Mixture-of-Expert Models with Seamless Runtime Parallelism Switch
Shaoyu Wang, Yizhuo Liang, Jaeyong Song +2
Mixture-of-Experts (MoE) architectures scale large language models (LLMs) to hundreds of billions of parameters. Serving a single MoE model requires multiple GPUs operating in para…
Vector-Quantized Discrete Latent Factors Meet Financial Priors: Dynamic Cross-Sectional Stock Ranking Prediction for Portfolio Construction
Namhyoung Kim, Jae Wook Song
Predicting cross-sectional stock returns is challenging due to low signal-to-noise ratios and evolving market regimes. Classical factor models offer interpretability but limited fl…
NAVIS: Concurrent Search and Update with Low Position-Seeking Overhead in On-SSD Graph-Based Vector Search
Jaeyong Song, Hongsun Jang, Changmin Shin +4
On-disk graph-based vector search (GVS) has become the dominant approach for serving large-scale vector databases at high recall, but prior systems struggle to sustain concurrent s…
GriNNder: Breaking the Memory Capacity Wall in Full-Graph GNN Training with Storage Offloading
Jaeyong Song, Seongyeon Park, Hongsun Jang +4
Full-graph training of graph neural networks (GNNs) is widely used as it enables direct validation of algorithmic improvements by preserving complete neighborhood information. Howe…
FlexiWalker: Extensible GPU Framework for Efficient Dynamic Random Walks with Runtime Adaptation
Seongyeon Park, Jaeyong Song, Changmin Shin +3
Dynamic random walks are fundamental to various graph analysis applications, offering advantages by adapting to evolving graph properties. Their runtime-dependent transition probab…
Piccolo: Large-Scale Graph Processing with Fine-Grained In-Memory Scatter-Gather
Changmin Shin, Jaeyong Song, Hongsun Jang +7
Graph processing requires irregular, fine-grained random access patterns incompatible with contemporary off-chip memory architecture, leading to inefficient data access. This ineff…
A Cost-Effective Near-Storage Processing Solution for Offline Inference of Long-Context LLMs
Hongsun Jang, Jaeyong Song, Changmin Shin +4
The computational and memory demands of large language models for generative inference present significant challenges for practical deployment. One promising solution targeting off…
Pipette: Automatic Fine-grained Large Language Model Training Configurator for Real-World Clusters
Jinkyu Yim, Jaeyong Song, Yerim Choi +4
Training large language models (LLMs) is known to be challenging because of the huge computational and memory capacity requirements. To address these issues, it is common to use a…
Smart-Infinity: Fast Large Language Model Training using Near-Storage Processing on a Real System
Hongsun Jang, Jaeyong Song, Jaewon Jung +3
The recent huge advance of Large Language Models (LLMs) is mainly driven by the increase in the number of parameters. This has led to substantial memory capacity requirements, nece…
AGAThA: Fast and Efficient GPU Acceleration of Guided Sequence Alignment for Long Read Mapping
Seongyeon Park, Junguk Hong, Jaeyong Song +3
With the advance in genome sequencing technology, the lengths of deoxyribonucleic acid (DNA) sequencing results are rapidly increasing at lower prices than ever. However, the longe…
PeerAiD: Improving Adversarial Distillation from a Specialized Peer Tutor
Jaewon Jung, Hongsun Jang, Jaeyong Song +1
Adversarial robustness of the neural network is a significant concern when it is applied to security-critical domains. In this situation, adversarial distillation is a promising op…
GraNNDis: Efficient Unified Distributed Training Framework for Deep GNNs on Large Clusters
Jaeyong Song, Hongsun Jang, Jaewon Jung +2
Graph neural networks (GNNs) are one of the rapidly growing fields within deep learning. While many distributed GNN training frameworks have been proposed to increase the training…
Pipe-BD: Pipelined Parallel Blockwise Distillation
Hongsun Jang, Jaewon Jung, Jaeyong Song +3
Training large deep neural network models is highly challenging due to their tremendous computational and memory requirements. Blockwise distillation provides one promising method…
SGCN: Exploiting Compressed-Sparse Features in Deep Graph Convolutional Network Accelerators
Mingi Yoo, Jaeyong Song, Jounghoo Lee +3
Graph convolutional networks (GCNs) are becoming increasingly popular as they overcome the limited applicability of prior neural networks. A GCN takes as input an arbitrarily struc…
Optimus-CC: Efficient Large NLP Model Training with 3D Parallelism Aware Communication Compression
Jaeyong Song, Jinkyu Yim, Jaewon Jung +4
In training of modern large natural language processing (NLP) models, it has become a common practice to split models using 3D parallelism to multiple GPUs. Such technique, however…
Slice-and-Forge: Making Better Use of Caches for Graph Convolutional Network Accelerators
Mingi Yoo, Jaeyong Song, Hyeyoon Lee +4
Graph convolutional networks (GCNs) are becoming increasingly popular as they can process a wide variety of data formats that prior deep neural networks cannot easily support. One…