activity
20182026
most citedEMI: Exploration with Mutual Information

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

collaborators
Showing cs.LGShow all

6 papers · 1 filter

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.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…