← Search

Dongkwan Kim

6 accepted papers

2025

LLM-as-an-Interviewer: Beyond Static Testing Through Dynamic LLM Evaluation

ACL 2025finding

We introduce LLM-as-an-Interviewer, a novel paradigm for evaluating large language models (LLMs). This approach leverages multi-turn interactions where the LLM interviewer actively provides feedback on responses and poses follow-up questions to the evaluated LLM. At the start of the interview, the L…

2025

MUG-Eval: A Proxy Evaluation Framework for Multilingual Generation Capabilities in Any Language

EMNLP 2025

Evaluating text generation capabilities of large language models (LLMs) is challenging, particularly for low-resource languages where methods for direct assessment are scarce. We propose MUG-Eval, a novel framework that evaluates LLMs’ multilingual generation capabilities by transforming existing be

2024

Perceptions to Beliefs: Exploring Precursory Inferences for Theory of Mind in Large Language Models

EMNLP 2024main

While humans naturally develop theory of mind (ToM), the capability to understand other people’s mental states and beliefs, state-of-the-art large language models (LLMs) underperform on simple ToM benchmarks. We posit that we can extend our understanding of LLMs’ ToM abilities by evaluating key huma…

2024

Translating Subgraphs to Nodes Makes Simple GNNs Strong and Efficient for Subgraph Representation Learning

ICML 2024poster

Subgraph representation learning has emerged as an important problem, but it is by default approached with specialized graph neural networks on a large global graph. These models demand extensive memory and computational resources but challenge modeling hierarchical structures of subgraphs. In this…

2021

How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervision

ICLR 2021poster

Attention mechanism in graph neural networks is designed to assign larger weights to important neighbor nodes for better representation. However, what graph attention learns is not understood well, particularly when graphs are noisy. In this paper, we propose a self-supervised graph attention networ…