Papers by Jongyoon Kim
Rare Tokens Degenerate All Tokens: Improving Neural Text Generation via Adaptive Gradient Gating for Rare Token Embeddings (2022.acl-long)
Copied to clipboard
| Challenge: | Recent studies have determined that the learned token embeddings of large-scale neural language models are degenerated to be anisotropic with a narrow-cone shape. |
| Approach: | They propose a method to degenerate the learning gradient for rare token embeddings by gating the specific part of the gradient for all tokens during training stage. |
| Outcome: | The proposed method improves the performance of the models but lacks the training dynamics needed to solve the representation degeneration problem. |
DADA: Distribution-Aware Domain Adaptation of PLMs for Information Retrieval (2024.findings-acl)
Copied to clipboard
| Challenge: | Pre-trained language models struggle with out-of-domain data due to distribution shifts . generative domain adaptation (DA) methods have been proposed to address these issues . |
| Approach: | They propose a distribution-aware domain adaptation method to address distribution shifts in domains . they use observation-level feedback and observation- level feedback to adapt to the target domain . |
| Outcome: | The proposed method adapts to the domain distribution knowledge at the level of a single document and the corpus and expands document representation to unseen gold query terms using domain and observation feedback. |
Unleashing Multi-Hop Reasoning Potential in Large Language Models through Repetition of Misordered Context (2025.findings-naacl)
Copied to clipboard
| Challenge: | Multi-hop reasoning requires multi-step reasoning based on supporting documents within a given context. |
| Approach: | They propose a method that prompts the model by repeatedly presenting the context. |
| Outcome: | The proposed method improves the F1 score by 30%p on multi-hop QA tasks and increases accuracy by 70%p on a synthetic task. |
UnIte: Uncertainty-based Iterative Document Sampling for Domain Adaptation in Information Retrieval (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods focus on diversity but fail to capture model uncertainty. |
| Approach: | They propose a method to generalize neural retrievers to an unseen domain by generating pseudo queries on target domain documents. |
| Outcome: | The proposed method improves performance on large datasets with small and large models while limiting the learning utility of the current model. |
AligNART: Non-autoregressive Neural Machine Translation by Jointly Learning to Estimate Alignment and Translate (2021.emnlp-main)
Copied to clipboard
| Challenge: | Non-autoregressive neural machine translation models suffer from the multi-modality problem . aligNART leverages full alignment information to explicitly reduce the modality of the target distribution . |
| Approach: | They propose an alignment decomposition method which explicitly reduces the modality of the target distribution. |
| Outcome: | The proposed model outperforms previous models that focus on modality reduction on two translation tasks. |
TRUEBench: Can LLM Response Meet Real-world Constraints as Productivity Assistant? (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing benchmarks fail to evaluate large language models' instruction-following capabilities . current benchmarks lack multilinguality, implicit constraints and multi-turn dialogue . |
| Approach: | a new benchmark is designed to evaluate large language models' instruction-following capabilities . the benchmark features input prompts across 12 languages and includes inter-instance multilingual instructions . |
| Outcome: | a new benchmark for large language models (LLMs) is designed to assess their performance in real-world settings. |
tRAG: Term-level Retrieval-Augmented Generation for Domain-Adaptive Retrieval (2025.naacl-long)
Copied to clipboard
| Challenge: | Neural retrieval models suffer when there is a domain shift between training and test data distributions. |
| Approach: | They propose to generate domain-adapted pseudo-queries using large language models (LLMs) to improve term recall of unseen query terms by using term-level Retrieval-Augmented Generation (tRAG). |
| Outcome: | The proposed method significantly improves recall for unseen terms by 10.6% and outperforms LLM and retrieval-augmented generation baselines on overall retrieval performance. |
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. |
QuBE: Question-based Belief Enhancement for Agentic LLM Reasoning (2024.emnlp-main)
Copied to clipboard
| Challenge: | Recent advances in Large Language Models (LLMs) have led to an explosion of interest in their deployment as agents. |
| Approach: | They propose a method that enhances agents’ focus on task-relevant contexts by constructing a belief state via question answering. |
| Outcome: | The proposed method outperforms established baselines and achieves marked improvements on the BeIR zero-shot retrieval benchmark. |
Benchmarking Testing in Automated Theorem Proving (2026.acl-industry)
Copied to clipboard
| Challenge: | Existing evaluations rely on indirect proxies such as lexical overlap with human-annotated proof, or expensive manual inspection. |
| Approach: | They propose a framework that evaluates the semantic correctness of formal theorems . they use a set of problems paired with 41 successor theorels to compare them . |
| Outcome: | The proposed framework evaluates the semantic correctness of formal theorems using real-world Lean 4 repositories. |