← Search

Daehyun Ahn

5 accepted papers

2025

GraLoRA: Granular Low-Rank Adaptation for Parameter-Efficient Fine-Tuning

NeurIPS 2025spotlight

Low-Rank Adaptation (LoRA) is a popular method for parameter-efficient fine-tuning (PEFT) of generative models, valued for its simplicity and effectiveness. Despite recent enhancements, LoRA still suffers from a fundamental limitation: overfitting when the bottleneck is widened. It performs best at…

Cited by 0SourceScholar
2023

Leveraging Early-Stage Robustness in Diffusion Models for Efficient and High-Quality Image Synthesis

NeurIPS 2023poster

While diffusion models have demonstrated exceptional image generation capabilities, the iterative noise estimation process required for these models is compute-intensive and their practical implementation is limited by slow sampling speeds. In this paper, we propose a novel approach to speed up the…

Cited by 8SourcePDFScholar
2023

Temporal Dynamic Quantization for Diffusion Models

NeurIPS 2023poster

Diffusion model has gained popularity in vision applications due to its remarkable generative performance and versatility. However, its high storage and computation demands, resulting from the model size and iterative generation, hinder its use on mobile devices. Existing quantization techniques str…

Cited by 56SourcePDFScholar
2019

Double Viterbi: Weight Encoding for High Compression Ratio and Fast On-Chip Reconstruction for Deep Neural Network

ICLR 2019poster

Weight pruning has been introduced as an efficient model compression technique. Even though pruning removes significant amount of weights in a network, memory requirement reduction was limited since conventional sparse matrix formats require significant amount of memory to store index-related inform…

Cited by 14SourcePDFScholar
2018

Viterbi-based Pruning for Sparse Matrix with Fixed and High Index Compression Ratio

ICLR 2018poster

Weight pruning has proven to be an effective method in reducing the model size and computation cost while not sacrificing the model accuracy. Conventional sparse matrix formats, however, involve irregular index structures with large storage requirement and sequential reconstruction process, resultin…

Cited by 24SourcePDFScholar