Papers by Hojae Lee
ArchCode: Incorporating Software Requirements in Code Generation with Large Language Models (2024.acl-long)
Copied to clipboard
| Challenge: | Despite the critical role of software requirements, these criteria have not been studied actively in previous code generation works. |
| Approach: | They propose a framework that leverages in-context learning to organize and extrapolate unexpressed requirements from textual descriptions. |
| Outcome: | The proposed framework generates functional requirements from textual descriptions and extrapolates unexpressed requirements from them. |
Mentor-KD: Making Small Language Models Better Multi-step Reasoners (2024.emnlp-main)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have shown impressive emergent capabilities by leveraging Chain-of-Thought (CoT) prompting. |
| Approach: | They propose a Knowledge Distillation approach which transfers multi-step reasoning ability of Large Language Models (LLMs) to smaller LMs by fine-tuning language models of multi- step rationales generated by LLM teachers. |
| Outcome: | The proposed method is able to transfer multi-step reasoning ability of LLMs to smaller LMs while addressing data quality and soft label provision. |
On Sample-Efficient Code Generation (2023.emnlp-industry)
Copied to clipboard
Hojae Han, Yu Jin Kim, Byoungjip Kim, Youngwon Lee, Kyungjae Lee, Kyungmin Lee, Moontae Lee, Kyunghoon Bae, Seung-won Hwang
| Challenge: | Existing approaches to code generation rely on rejection sampling to generate multiple code snippets then select the best. |
| Approach: | They propose a framework that prioritizes sampling on test problems that models can solve. |
| Outcome: | The proposed framework reduces sampling costs while maintaining comparable code generation performance. |
Learning with Limited Data for Multilingual Reading Comprehension (D19-1)
Copied to clipboard
| Challenge: | Existing approaches to support question answering in a new language with limited training resources introduce noises to the training data due to translation or generation errors. |
| Approach: | They propose a weakly-supervised framework that quantifies noises from automatically generated labels to deemphasize or fix noisy data in training. |
| Outcome: | The proposed framework can deemphasize or fix noisy data in training on low-resource languages with varying similarity to English. |
DuET: Dual Execution for Test Output Prediction with Generated Code and Pseudocode (2026.findings-acl)
Copied to clipboard
| Challenge: | Recent studies have shown that test output prediction is difficult to achieve due to code errors. |
| Approach: | They propose a framework that grounds prediction on error-resilient pseudocode and simulates execution via LLM reasoning to overcome limitations of direct execution suffering from code errors. |
| Outcome: | The proposed framework improves Pass@1 on LiveCodeBench, BigCodeBech-Hard, DevEval and HumanEval(+) and improves on pass@1 by 13.6 pp. |
PERC: Plan-As-Query Example Retrieval for Underrepresented Code Generation (2025.coling-main)
Copied to clipboard
| Challenge: | Using large language models to generate code has shown significant promise, but selecting effective examples to improve generation quality remains a challenging task. |
| Approach: | They propose a framework that utilizes algorithmic plans to identify and retrieve effective examples. |
| Outcome: | The proposed framework outperforms the state-of-the-art RAG methods in code generation even when the source and target languages match or differ. |
PLEX: Adaptive Parameter-Efficient Fine-Tuning for Code LLMs using Lottery-Tickets (2025.naacl-industry)
Copied to clipboard
| Challenge: | PLEX is a lottery-ticket based parameter-efficient fine-tuning method that adapts large language models to well-supported and underrepresented programming languages (PLs) in pretraining. |
| Approach: | They propose a lottery-ticket based parameter-efficient fine-tuning method that adapts large language models to well-supported and underrepresented programming languages (PLs) |
| Outcome: | The proposed method achieves state-of-the-art performance among PEFT methods while maintaining competitive results with reduced computational overhead. |