Deokjae Lee

I am a postdoctoral researcher at Seoul National University, working with Prof. Hyun Oh Song and his research group SNU MLLAB. I completed my Ph.D. in Computer Science and Engineering at Seoul National University in 2026, advised by Prof. Hyun Oh Song. From September 2023 to February 2024, I was a visiting researcher in Kyunghyun Cho's group at New York University (NYU), where I worked on multi-objective black-box optimization for combinatorial problems. Before that, I earned a B.S. in Mathematical Science from Seoul National University in 2020.

Email  /  Google Scholar  /  Github  /  CV

profile photo
Research

My research develops scalable optimization algorithms for real-world machine learning problems. In my doctoral research, I focused on high-dimensional black-box and discrete settings, with contributions to LLM quantization (Q-Strata, Q-Palette, GuidedQuant), neural network compression (depth pruning, QCQP pruning), LLM safety (Bayesian red teaming, discrete block Bayesian attack), and biological sequence design (greedy-policy).

Publications
Q-Strata: Hierarchical Bit Allocation for Mixed-Precision Quantization of Mixture-of-Experts LLMs
Deokjae Lee, Sihun Chu, Hyun Oh Song,
Empirical Methods in Natural Language Processing (EMNLP), 2026
paper / code / bibtex

Q-Strata is a bi-level mixed-precision quantization method for MoE LLMs. Within each block, a cheap proxy caches budget-quality tradeoff candidates. Across blocks, the outer stage decides each block's budget by directly optimizing the quality score.

Q-Palette: Fractional-Bit Quantizers Toward Optimal Bit Allocation for Efficient LLM Deployment
Deokjae Lee, Hyun Oh Song,
Neural Information Processing Systems (NeurIPS), 2025
paper / poster / code / bibtex

We develop Q-Palette, a quantizer suite with efficient inference CUDA kernels and wide fractional-bit support. Built on Q-Palette, we propose a novel mixed-scheme quantization framework that jointly optimizes quantizer selection and layer fusion.

GuidedQuant: Large Language Model Quantization via Exploiting End Loss Guidance
Jinuk Kim, Marwa El Halabi, Wonpyo Park, Clemens JS Schaefer, Deokjae Lee, Yeonhong Park, Jae W. Lee, Hyun Oh Song,
International Conference on Machine Learning (ICML), 2025
paper / code / project / bibtex

We propose GuidedQuant, a novel quantization approach that integrates gradient information from the end loss into the layer-wise quantization objective.

Training Greedy Policy for Proposal Batch Selection in Expensive Multi-Objective Combinatorial Optimization
Deokjae Lee, Hyun Oh Song, Kyunghyun Cho
International Conference on Machine Learning (ICML), 2024
paper / code / bibtex

We propose a novel subset selection method which trains a greedy policy to solve marginal gain maximization problems concurrently.

Efficient Latency-Aware CNN Depth Compression via Two-Stage Dynamic Programming
Jinuk Kim*, Yeonwoo Jeong*, Deokjae Lee, Hyun Oh Song
International Conference on Machine Learning (ICML), 2023
paper / code / bibtex

We propose a subset selection optimization problem for depth compression which can be efficiently solved via two-stage dynamic programming.

Query-Efficient Black-Box Red Teaming via Bayesian Optimization
Deokjae Lee, JunYeong Lee, Jung-Woo Ha, Jin-Hwa Kim, Sang-Woo Lee, Hwaran Lee, Hyun Oh Song
Annual Meeting of the Association for Computational Linguistics (ACL), 2023
paper / poster / code / bibtex

We propose a novel query-efficient red teaming method, namely Bayesian red teaming (BRT), which identifies failures of black-box generative models by choosing and editing user inputs with GP surrogate models.

Query-Efficient and Scalable Black-Box Adversarial Attacks on Discrete Sequential Data via Bayesian Optimization
Deokjae Lee, Seungyong Moon, Junhyeok Lee, Hyun Oh Song
International Conference on Machine Learning (ICML), 2022
paper / poster / code / bibtex

Crafting adversarial examples against language models is challenging due to its discrete nature and dynamic input size. We tackle these problems using Bayesian optimization and develop a query-efficient black-bax adversarial attack against various types of models.

Optimal channel selection with discrete QCQP
Yeonwoo Jeong*, Deokjae Lee*, Gaon An, Changyong Son, Hyun Oh Song
International Conference on Artificial Intelligence and Statistics (AISTATS), 2022
paper / code / bibtex

We propose a novel channel selection method that optimally selects channels via discrete QCQP, which provably prevents any inactive weights and guarantees to meet the resource constraints tightly in terms of FLOPs, memory usage, and network size.

Experiences
  • Postdoctoral Researcher, AI Institute, Seoul National University, Seoul, South Korea, Sep 2026 - Current.
  • Visiting Scholar, Center for Data Science, NYU, New York, USA, Sep 2023 - Feb 2024.
  • Research Intern, DeepMetrics, Seoul, South Korea, Jul 2023 - Aug 2023.
  • Research Intern, Visual Camp, Pangyo, South Korea, Dec 2018 - Feb 2019.
Teaching
  • Teaching Assistant, Introduction to Deep Learning (M2177.0043), Spring 2023
  • Teaching Assistant, Machine Learning (4190.666), Fall 2020
  • Undergraduate Student Instructor, Basic Calculus 2 (033.017), Fall 2017
  • Undergraduate Student Instructor, Basic Calculus 1 (033.016), Spring 2017
Honors and Awards
  • Outstanding Doctoral Thesis Award, Department of Computer Science and Engineering, Seoul National University (2026)
  • Qualcomm Innovation Fellowship Korea Finalist (2023)
  • Yulchon AI Star Scholarship (2023)
  • Qualcomm Innovation Fellowship Korea Finalist (2022)
  • Silver Medal, Korean Contest of Mathematics for University Students (2019)
  • National Science & Technology Scholarship, (2018. 03. - 2020. 02.)
  • Silver medal, Korean Mathematical Olympiad (KMO) (2013)
Dissertation
  • Scalable Methods for High-Dimensional Black-Box Discrete Optimization in Real-World Problems, Ph.D. Dissertation, 2026 | paper
Academic Services
  • Conference Reviewer: NeurIPS (2022-2026), ICML (2023-2026), ICLR (2024-2025), AAAI (2024,2026), ACL (2023), EMNLP (2023), COLM (2024,2026)
  • Journal Reviewer: TPAMI (2024), TMLR (2026)

This website is modified from here.