Demo Data from EDBT 2026 / reviewers in the wild / expert
Je-Hwan Ryu
dblp:202/6803
· DBLP profile ↗
4ranked-venue papers
0as first author
4since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 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
3 papers |
Reinforcement learning · 69% 3D vision · 24% Robot manipulation · 7% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › imitation learning › occupancy matching
adversarial imitation learning |
0.6 | 1 | 2022 | Robust Imitation via Mirror Descent Inverse Reinforcement Learning · NeurIPS 2022 |
Machine learning › Reinforcement learning › imitation learning
inverse reinforcement learning |
0.6 | 1 | 2022 | Robust Imitation via Mirror Descent Inverse Reinforcement Learning · NeurIPS 2022 |
Mathematical optimization › continuous optimization
convex optimization |
0.6 | 1 | 2022 | Robust Imitation via Mirror Descent Inverse Reinforcement Learning · NeurIPS 2022 |
Mathematical optimization › continuous optimization › convex optimization › first-order methods
mirror descent |
0.6 | 1 | 2022 | Robust Imitation via Mirror Descent Inverse Reinforcement Learning · NeurIPS 2022 |
Machine learning › Reinforcement learning
goal-conditioned reinforcement learning |
0.5 | 1 | 2021 | Goal-Aware Cross-Entropy for Multi-Target Reinforcement Learning · NeurIPS 2021 |
Machine learning › Reinforcement learning › goal-conditioned reinforcement learning
multi-goal reinforcement learning |
0.5 | 1 | 2021 | Goal-Aware Cross-Entropy for Multi-Target Reinforcement Learning · NeurIPS 2021 |
Robotics › Robot manipulation
grasping |
0.2 | 1 | 2024 | Dense Hand-Object (HO) GraspNet with Full Grasping Taxonomy and Dynamics · ECCV (82) 2024 |
Methods — techniques the papers use, named apart from their topics
mirror descent · 1.1bregman divergence · 1.1adversarial imitation learning · 1.1grasp taxonomy · 0.8self-supervised learning · 0.5cross-entropy loss · 0.5attention · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Dense Hand-Object (HO) GraspNet with Full Grasping Taxonomy and Dynamics
Woojin Cho 0002, Minjae Yi, Taeyun Woo, Taewook Ha, Hyokeun Lee, Je-Hwan Ryu, Woontack Woo, Tae-Kyun Kim 0001 |
ECCV (82) | 9 |
| 2022 | Robust Imitation via Mirror Descent Inverse Reinforcement LearningabstractRecently, adversarial imitation learning has shown a scalable reward acquisition method for inverse reinforcement learning (IRL) problems. However, estimated reward signals often become uncertain and fail to train a reliable statistical model since the existing methods tend to solve hard optimization problems directly. Inspired by a first-order optimization method called mirror descent, this paper proposes to predict a sequence of reward functions, which are iterative solutions for a constrained convex problem. IRL solutions derived by mirror descent are tolerant to the uncertainty incurred by target density estimation since the amount of reward learning is regulated with respect to local geometric constraints. We prove that the proposed mirror descent update rule ensures robust minimization of a Bregman divergence in terms of a rigorous regret bound of $\mathcal{O}(1/T)$ for step sizes $\{\eta_t\}_{t=1}^{T}$. Our IRL method was applied on top of an adversarial framework, and it outperformed existing adversarial methods in an extensive suite of benchmarks. Dong-Sig Han, Hyunseo Kim 0001, Hyundo Lee, Je-Hwan Ryu, Byoung-Tak Zhang |
NeurIPS | 4 |
| 2021 | Goal-Aware Cross-Entropy for Multi-Target Reinforcement LearningabstractLearning in a multi-target environment without prior knowledge about the targets requires a large amount of samples and makes generalization difficult. To solve this problem, it is important to be able to discriminate targets through semantic understanding. In this paper, we propose goal-aware cross-entropy (GACE) loss, that can be utilized in a self-supervised way using auto-labeled goal states alongside reinforcement learning. Based on the loss, we then devise goal-discriminative attention networks (GDAN) which utilize the goal-relevant information to focus on the given instruction. We evaluate the proposed methods on visual navigation and robot arm manipulation tasks with multi-target environments and show that GDAN outperforms the state-of-the-art methods in terms of task success ratio, sample efficiency, and generalization. Additionally, qualitative analyses demonstrate that our proposed method can help the agent become aware of and focus on the given instruction clearly, promoting goal-directed behavior. Kibeom Kim, Min Whoo Lee, Yoonsung Kim, Je-Hwan Ryu, Minsu Lee 0001, Byoung-Tak Zhang |
NeurIPS | 4 |
| 2021 | RoboCup@Home 2021 Domestic Standard Platform League Winner
Dongwoon Song, Taewoong Kang, Jae-Bong Yi, Joonyoung Kim 0004, Taeyang Kim, Chung-Yeon Lee, Je-Hwan Ryu, Minji Kim 0005, Hyun-Jun Jo, Byoung-Tak Zhang, Jae-Bok Song, Seung-Joon Yi |
RoboCup | 7 |