Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Beong-woo Kwak

dblp:312/4786 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
7since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 7 · 1 first-author · 7 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
5 papers
Language models and text generation · 26% Reinforcement learning · 18% Question answering and dialogue systems · 12%
Software engineering, system software, and programming languages
2 papers
Compilers and program optimization · 67% Debugging and program repair · 33%

Topics — the 14 heaviest of 15, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Compilers and program optimization
code generation
1.522024
Coffee-Gym: An Environment for Evaluating and Improving Natural Language Feedback on Erroneous Code · EMNLP 2024
Language Models as Compilers: Simulating Pseudocode Execution Improves Algorithmic Reasoning in Language Models · EMNLP 2024
Natural language and speech › Language models and text generation
large language model evaluation
0.912025
LLM Meets Scene Graph: Can Large Language Models Understand and Generate Scene Graphs? A Benchmark and Empirical Study · ACL (1) 2025
Computer vision › Vision and language › vision-language model
multimodal large language model
0.912025
Web-Shepherd: Advancing PRMs for Reinforcing Web Agents · NeurIPS 2025
Machine learning › Reinforcement learning › reinforcement learning from human feedback
process reward model
0.912025
Web-Shepherd: Advancing PRMs for Reinforcing Web Agents · NeurIPS 2025
Machine learning › Reinforcement learning › reward learning
reward modeling
0.912025
Web-Shepherd: Advancing PRMs for Reinforcing Web Agents · NeurIPS 2025
Natural language and speech › Language models and text generation › LLM agents
web agents
0.912025
Web-Shepherd: Advancing PRMs for Reinforcing Web Agents · NeurIPS 2025
Machine learning › Graph learning
algorithmic reasoning
0.812024
Language Models as Compilers: Simulating Pseudocode Execution Improves Algorithmic Reasoning in Language Models · EMNLP 2024
Natural language and speech › Language models and text generation
large language model reasoning
0.812024
Language Models as Compilers: Simulating Pseudocode Execution Improves Algorithmic Reasoning in Language Models · EMNLP 2024
Debugging and program repair
program repair
0.812024
Coffee-Gym: An Environment for Evaluating and Improving Natural Language Feedback on Erroneous Code · EMNLP 2024
Machine learning › Efficient and distributed learning
active learning
0.612022
TrustAL: Trustworthy Active Learning Using Knowledge Distillation · AAAI 2022
Natural language and speech › Question answering and dialogue systems › dialogue generation
dialogue response generation
0.612022
Dual Task Framework for Improving Persona-Grounded Dialogue Dataset · AAAI 2022
Machine learning › Trustworthy machine learning › robustness
learning with noisy labels
0.612022
TrustAL: Trustworthy Active Learning Using Knowledge Distillation · AAAI 2022
Natural language and speech › Question answering and dialogue systems › personalized dialogue
persona-grounded dialogue
0.612022
Dual Task Framework for Improving Persona-Grounded Dialogue Dataset · AAAI 2022
Machine learning › Trustworthy machine learning
robustness
0.612022
TrustAL: Trustworthy Active Learning Using Knowledge Distillation · AAAI 2022

Methods — techniques the papers use, named apart from their topics

large language model · 2.3chain-of-thought · 1.5process reward model · 0.9preference pairs · 0.9benchmark evaluation · 0.9reinforcement learning · 0.8uncertainty sampling · 0.6primal-dual learning · 0.6knowledge distillation · 0.6diversity sampling · 0.6data augmentation · 0.6
YearPublicationVenuePosition
2025 LLM Meets Scene Graph: Can Large Language Models Understand and Generate Scene Graphs? A Benchmark and Empirical Study
abstract
The remarkable reasoning and generalization capabilities of Large Language Models (LLMs) have paved the way for their expanding applications in embodied AI, robotics, and other real-world tasks. To effectively support these applications, grounding in spatial and temporal understanding in multimodal environments is essential. To this end, recent works have leveraged scene graphs, a structured representation that encodes entities, attributes, and their relationships in a scene. However, a comprehensive evaluation of LLMs’ ability to utilize scene graphs remains limited. In this work, we introduce Text-Scene Graph (TSG) Bench, a benchmark designed to systematically assess LLMs’ ability to (1) understand scene graphs and (2) generate them from textual narratives. With TSG Bench we evaluate 11 LLMs and reveal that, while models perform well on scene graph understanding, they struggle with scene graph generation, particularly for complex narratives. Our analysis indicates that these models fail to effectively decompose discrete scenes from a complex narrative, leading to a bottleneck when generating scene graphs. These findings underscore the need for improved methodologies in scene graph generation and provide valuable insights for future research. The demonstration of our benchmark is available at https://tsg-bench.netlify.app. Additionally, our code and evaluation data are publicly available at https://github.com/docworlds/tsg-bench.
Dongil Yang, Minjin Kim, Sunghwan Kim 0005, Beong-woo Kwak, Minjun Park, Jinseok Hong, Woontack Woo, Jinyoung Yeo
ACL (1)4
2025 Web-Shepherd: Advancing PRMs for Reinforcing Web Agents
abstract
Web navigation is a unique domain that can automate many repetitive real-life tasks and is challenging as it requires long-horizon sequential decision making beyond typical multimodal large language model (MLLM) tasks. Yet, specialized reward models for web navigation that can be utilized during both training and test-time have been absent until now. Despite the importance of speed and cost-effectiveness, prior works have utilized MLLMs as reward models, which poses significant constraints for real-world deployment. To address this, in this work, we propose the first process reward model (PRM) called Web-Shepherd which could assess web navigation trajectories in a step-level. To achieve this, we first construct the WebPRM Collection, a large-scale dataset with 40K step-level preference pairs and annotated checklists spanning diverse domains and difficulty levels. Next, we also introduce the WebRewardBench, the first meta-evaluation benchmark for evaluating PRMs. In our experiments, we observe that our Web-Shepherd achieves about 30 points better accuracy compared to using GPT-4o on WebRewardBench. Furthermore, when testing on WebArena-lite by using GPT-4o-mini as the policy and Web-Shepherd as the verifier, we achieve 10.9 points better performance, in 10x less cost compared to using GPT-4o-mini as the verifier. Our model, dataset, and code are publicly available at https://github.com/kyle8581/Web-Shepherd.
Hyungjoo Chae, Seonghwan Kim, Seungone Kim, Seungjun Moon, Gyeom Hwangbo, Dongha Lim, Minjin Kim, Yeonjun Hwang, Minju Gwak, Dongwook Choi, Gwanhoon Im, ByeongUng Cho, Hyojun Kim, Jun Hee Han, Taeyoon Kwon, Beong-woo Kwak, Dongjin Kang, Jinyoung Yeo
NeurIPS19
2024 Language Models as Compilers: Simulating Pseudocode Execution Improves Algorithmic Reasoning in Language Models
abstract
Hyungjoo Chae, Yeonghyeon Kim, Seungone Kim, Kai Tzu-iunn Ong, Beong-woo Kwak, Moohyeon Kim, Sunghwan Kim, Taeyoon Kwon, Jiwan Chung, Youngjae Yu, Jinyoung Yeo. Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing. 2024.
Hyungjoo Chae, Yeonghyeon Kim, Seungone Kim, Kai Tzu-iunn Ong, Beong-woo Kwak, Moohyeon Kim, Sunghwan Kim 0005, Taeyoon Kwon, Jiwan Chung, Youngjae Yu, Jinyoung Yeo
EMNLP5
2024 Coffee-Gym: An Environment for Evaluating and Improving Natural Language Feedback on Erroneous Code
abstract
Hyungjoo Chae, Taeyoon Kwon, Seungjun Moon, Yongho Song, Dongjin Kang, Kai Tzu-iunn Ong, Beong-woo Kwak, Seonghyeon Bae, Seung-won Hwang, Jinyoung Yeo. Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing. 2024.
Hyungjoo Chae, Taeyoon Kwon, Seungjun Moon, Yongho Song, Dongjin Kang, Kai Tzu-iunn Ong, Beong-woo Kwak, Seonghyeon Bae, Seung-won Hwang, Jinyoung Yeo
EMNLP7
2022 Dual Task Framework for Improving Persona-Grounded Dialogue Dataset
abstract
This paper introduces a simple yet effective data-centric approach for the task of improving persona-conditioned dialogue agents. Prior model-centric approaches unquestioningly depend on the raw crowdsourced benchmark datasets such as Persona-Chat. In contrast, we aim to fix annotation artifacts in benchmarking, which is orthogonally applicable to any dialogue model. Specifically, we augment relevant personas to improve dialogue dataset/agent, by leveraging the primal-dual structure of the two tasks, predicting dialogue responses and personas based on each other. Experiments on Persona-Chat show that our approach outperforms pre-trained LMs by an 11.7 point gain in terms of accuracy.
Beong-woo Kwak, Youngwook Kim 0002, Hong-in Lee, Seung-won Hwang, Jinyoung Yeo
AAAI2
2022 TrustAL: Trustworthy Active Learning Using Knowledge Distillation
abstract
Active learning can be defined as iterations of data labeling, model training, and data acquisition, until sufficient labels are acquired. A traditional view of data acquisition is that, through iterations, knowledge from human labels and models is implicitly distilled to monotonically increase the accuracy and label consistency. Under this assumption, the most recently trained model is a good surrogate for the current labeled data, from which data acquisition is requested based on uncertainty/diversity. Our contribution is debunking this myth and proposing a new objective for distillation. First, we found example forgetting, which indicates the loss of knowledge learned across iterations. Second, for this reason, the last model is no longer the best teacher-- For mitigating such forgotten knowledge, we select one of its predecessor models as a teacher, by our proposed notion of "consistency". We show that this novel distillation is distinctive in the following three aspects; First, consistency ensures to avoid forgetting labels. Second, consistency improves both uncertainty/diversity of labeled data. Lastly, consistency redeems defective labels produced by human annotators.
Beong-woo Kwak, Youngwook Kim 0002, Yu Jin Kim, Seung-won Hwang, Jinyoung Yeo
AAAI1
2022 Modularized Transfer Learning with Multiple Knowledge Graphs for Zero-shot Commonsense Reasoning
abstract
Yu Jin Kim, Beong-woo Kwak, Youngwook Kim, Reinald Kim Amplayo, Seung-won Hwang, Jinyoung Yeo. Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. 2022.
Yu Jin Kim, Beong-woo Kwak, Youngwook Kim 0002, Reinald Kim Amplayo, Seung-won Hwang, Jinyoung Yeo
NAACL-HLT2