activity
20182026
most citedEMI: Exploration with Mutual Information

29 citations · 58 across the 15 of their papers we have counts for

collaborators

16 papers

cs.CL2026

Co-Evolving Actor-Conditioned Critics for Non-Verifiable Generation

Jinyoung Kim, Muhammad Khalifa, Lajanugen Logeswaran +4

Natural-language critiques provide supervision beyond scalar rewards for non-verifiable generation, which lacks deterministic verifiers. In critique-guided refinement, a critic giv…

cs.AI2026

Scaling Web Agent Training through Automatic Data Generation and Fine-grained Evaluation

Lajanugen Logeswaran, Jaekyeom Kim, Sungryull Sohn +2

We present a scalable pipeline for automatically generating high-quality training data for web agents. In particular, a major challenge in identifying high-quality training instanc…

cs.AI2026

Gaming the Judge: Unfaithful Chain-of-Thought Can Undermine Agent Evaluation

Muhammad Khalifa, Lajanugen Logeswaran, Jaekyeom Kim +6

Large language models (LLMs) are increasingly used as judges to evaluate agent performance, particularly in non-verifiable settings where judgments rely on agent trajectories inclu…

cs.CV2025

Selective LoRA for Visual Tokens and Attention Heads

Tiange Luo, Lajanugen Logeswaran, Jaekyeom Kim +2

Low-rank adaptation (LoRA) is widely used for parameter-efficient fine-tuning, but its standard all-token, all-head design ignores the heterogeneous structure of vision language mo…

cs.LG2025★ 2 cited

Process Reward Models That Think

Muhammad Khalifa, Rishabh Agarwal, Lajanugen Logeswaran +5

Step-by-step verifiers -- also known as process reward models (PRMs) -- are a key ingredient for test-time scaling. PRMs require step-level supervision, making them expensive to tr…

cs.AI2025

MLRC-Bench: Can Language Agents Solve Machine Learning Research Challenges?

Yunxiang Zhang, Muhammad Khalifa, Shitanshu Bhushan +6

We introduce MLRC-Bench, a benchmark designed to quantify how effectively language agents can tackle challenging Machine Learning (ML) Research Competitions, with a focus on open r…

cs.CY2025

Do Not Trust Licenses You See: Dataset Compliance Requires Massive-Scale AI-Powered Lifecycle Tracing

Jaekyeom Kim, Sungryull Sohn, Gerrard Jeongwon Jo +5

This paper argues that a dataset's legal risk cannot be accurately assessed by its license terms alone; instead, tracking dataset redistribution and its full lifecycle is essential…

cs.CL2024★ 1 cited

Interactive and Expressive Code-Augmented Planning with Large Language Models

Anthony Z. Liu, Xinhe Wang, Jacob Sansom +5

Large Language Models (LLMs) demonstrate strong abilities in common-sense reasoning and interactive decision-making, but often struggle with complex, long-horizon planning tasks. R…

cs.CL2024

Auto-Intent: Automated Intent Discovery and Self-Exploration for Large Language Model Web Agents

Jaekyeom Kim, Dong-Ki Kim, Lajanugen Logeswaran +2

In this paper, we introduce Auto-Intent, a method to adapt a pre-trained large language model (LLM) as an agent for a target domain without direct fine-tuning, where we empirically…

cs.CL2024

Small Language Models Need Strong Verifiers to Self-Correct Reasoning

Yunxiang Zhang, Muhammad Khalifa, Lajanugen Logeswaran +4

Self-correction has emerged as a promising solution to boost the reasoning performance of large language models (LLMs), where LLMs refine their solutions using self-generated criti…

cs.CL2024★ 1 cited

AutoGuide: Automated Generation and Selection of Context-Aware Guidelines for Large Language Model Agents

Yao Fu, Dong-Ki Kim, Jaekyeom Kim +4

Recent advances in large language models (LLMs) have empowered AI agents capable of performing various sequential decision-making tasks. However, effectively guiding LLMs to perfor…

cs.LG2022★ 8 cited

Lipschitz-constrained Unsupervised Skill Discovery

Seohong Park, Jongwook Choi, Jaekyeom Kim +2

We study the problem of unsupervised skill discovery, whose goal is to learn a set of diverse and useful skills with no external reward. There have been a number of skill discovery…

cs.LG2021★ 7 cited

Time Discretization-Invariant Safe Action Repetition for Policy Gradient Methods

Seohong Park, Jaekyeom Kim, Gunhee Kim

In reinforcement learning, continuous time is often discretized by a time scale , to which the resulting performance is known to be highly sensitive. In this work, we seek to fi…

cs.LG2021★ 2 cited

Unsupervised Skill Discovery with Bottleneck Option Learning

Jaekyeom Kim, Seohong Park, Gunhee Kim

Having the ability to acquire inherent skills from environments without any external rewards or supervision like humans is an important problem. We propose a novel unsupervised ski…

cs.LG2021★ 8 cited

Drop-Bottleneck: Learning Discrete Compressed Representation for Noise-Robust Exploration

Jaekyeom Kim, Minjung Kim, Dongyeon Woo +1

We propose a novel information bottleneck (IB) method named Drop-Bottleneck, which discretely drops features that are irrelevant to the target variable. Drop-Bottleneck not only en…

cs.LG2018★ 29 cited

EMI: Exploration with Mutual Information

Hyoungseok Kim, Jaekyeom Kim, Yeonwoo Jeong +2

Reinforcement learning algorithms struggle when the reward signal is very sparse. In these cases, naive random exploration methods essentially rely on a random walk to stumble onto…