← Search

Yeong-Dae Kwon

6 accepted papers

2025

Preference Consistency Matters: Enhancing Preference Learning in Language Models with Automated Self-Curation of Training Corpora

NAACL 2025long

Inconsistent annotations in training corpora, particularly within preference learning datasets, pose challenges in developing advanced language models. These inconsistencies often arise from variability among annotators and inherent multi-dimensional nature of the preferences. To address these issue…

2024

Improving Instruction Following in Language Models through Proxy-Based Uncertainty Estimation

ICML 2024poster

Assessing response quality to instructions in language models is vital but challenging due to the complexity of human language across different contexts. This complexity often results in ambiguous or inconsistent interpretations, making accurate assessment difficult. To address this issue, we propos…

2022

Efficient Active Search for Combinatorial Optimization Problems

ICLR 2022poster

Recently numerous machine learning based methods for combinatorial optimization problems have been proposed that learn to construct solutions in a sequential decision process via reinforcement learning. While these methods can be easily combined with search strategies like sampling and beam search,…

2022

Simulation-guided Beam Search for Neural Combinatorial Optimization

NeurIPS 2022accept

Neural approaches for combinatorial optimization (CO) equip a learning mechanism to discover powerful heuristics for solving complex real-world problems. While neural approaches capable of high-quality solutions in a single shot are emerging, state-of-the-art approaches are often unable to take full…

2021

Matrix encoding networks for neural combinatorial optimization

NeurIPS 2021poster

Machine Learning (ML) can help solve combinatorial optimization (CO) problems better. A popular approach is to use a neural net to compute on the parameters of a given CO problem and extract useful information that guides the search for good solutions. Many CO problems of practical importance can be…

2020

POMO: Policy Optimization with Multiple Optima for Reinforcement Learning

NeurIPS 2020poster

In neural combinatorial optimization (CO), reinforcement learning (RL) can turn a deep neural net into a fast, powerful heuristic solver of NP-hard problems. This approach has a great potential in practical applications because it allows near-optimal solutions to be found without expert guides armed…