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

Seongun Kim

dblp:309/2897 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021Systems, architecture and hardware · 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
3 papers
Reinforcement learning · 54% Representation and self-supervised learning · 11% Learning paradigms · 11%

Topics — the 9 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning paradigms
curriculum learning
0.712023
Variational Curriculum Reinforcement Learning for Unsupervised Discovery of Skills · ICML 2023
Machine learning › Generative modeling › diffusion model
diffusion planning
0.712023
Refining Diffusion Planner for Reliable Behavior Synthesis by Automatic Detection of Infeasible Plans · NeurIPS 2023
Machine learning › Reinforcement learning
goal-conditioned reinforcement learning
0.712023
Variational Curriculum Reinforcement Learning for Unsupervised Discovery of Skills · ICML 2023
Machine learning › Reinforcement learning › hierarchical reinforcement learning
hierarchical deep reinforcement learning
0.712023
Adaptive and Explainable Deployment of Navigation Skills via Hierarchical Deep Reinforcement Learning · ICRA 2023
Machine learning › Representation and self-supervised learning
mutual information maximization
0.712023
Variational Curriculum Reinforcement Learning for Unsupervised Discovery of Skills · ICML 2023
Machine learning › Reinforcement learning › reinforcement learning for control
navigation policy learning
0.712023
Adaptive and Explainable Deployment of Navigation Skills via Hierarchical Deep Reinforcement Learning · ICRA 2023
Machine learning › Reinforcement learning
offline reinforcement learning
0.712023
Refining Diffusion Planner for Reliable Behavior Synthesis by Automatic Detection of Infeasible Plans · NeurIPS 2023
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
plan refinement
0.712023
Refining Diffusion Planner for Reliable Behavior Synthesis by Automatic Detection of Infeasible Plans · NeurIPS 2023
Machine learning › Reinforcement learning › hierarchical reinforcement learning › skill learning
unsupervised skill discovery
0.712023
Variational Curriculum Reinforcement Learning for Unsupervised Discovery of Skills · ICML 2023

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

variational empowerment · 0.7reward function design · 0.7restoration gap · 0.7intrinsic reward · 0.7information theory · 0.7diffusion model · 0.7deep reinforcement learning · 0.7attribution maps · 0.7
YearPublicationVenuePosition
2023 Variational Curriculum Reinforcement Learning for Unsupervised Discovery of Skills
abstract
Mutual information-based reinforcement learning (RL) has been proposed as a promising framework for retrieving complex skills autonomously without a task-oriented reward function through mutual information (MI) maximization or variational empowerment. However, learning complex skills is still challenging, due to the fact that the order of training skills can largely affect sample efficiency. Inspired by this, we recast variational empowerment as curriculum learning in goal-conditioned RL with an intrinsic reward function, which we name Variational Curriculum RL (VCRL). From this perspective, we propose a novel approach to unsupervised skill discovery based on information theory, called Value Uncertainty Variational Curriculum (VUVC). We prove that, under regularity conditions, VUVC accelerates the increase of entropy in the visited states compared to the uniform curriculum. We validate the effectiveness of our approach on complex navigation and robotic manipulation tasks in terms of sample efficiency and state coverage speed. We also demonstrate that the skills discovered by our method successfully complete a real-world robot navigation task in a zero-shot setup and that incorporating these skills with a global planner further increases the performance.
Seongun Kim, Kyowoon Lee, Jaesik Choi
ICML1
2023 Adaptive and Explainable Deployment of Navigation Skills via Hierarchical Deep Reinforcement Learning
abstract
For robotic vehicles to navigate robustly and safely in unseen environments, it is crucial to decide the most suitable navigation policy. However, most existing deep reinforcement learning based navigation policies are trained with a hand-engineered curriculum and reward function which are difficult to be deployed in a wide range of real-world scenarios. In this paper, we propose a framework to learn a family of low-level navigation policies and a high-level policy for deploying them. The main idea is that, instead of learning a single navigation policy with a fixed reward function, we simultaneously learn a family of policies that exhibit different behaviors with a wide range of reward functions. We then train the high-level policy which adaptively deploys the most suitable navigation skill. We evaluate our approach in simulation and the real world and demonstrate that our method can learn diverse navigation skills and adaptively deploy them. We also illustrate that our proposed hierarchical learning framework presents explainability by providing semantics for the behavior of an autonomous agent.
Kyowoon Lee, Seongun Kim, Jaesik Choi
ICRA2
2023 Refining Diffusion Planner for Reliable Behavior Synthesis by Automatic Detection of Infeasible Plans
abstract
Diffusion-based planning has shown promising results in long-horizon, sparse-reward tasks by training trajectory diffusion models and conditioning the sampled trajectories using auxiliary guidance functions. However, due to their nature as generative models, diffusion models are not guaranteed to generate feasible plans, resulting in failed execution and precluding planners from being useful in safety-critical applications. In this work, we propose a novel approach to refine unreliable plans generated by diffusion models by providing refining guidance to error-prone plans. To this end, we suggest a new metric named restoration gap for evaluating the quality of individual plans generated by the diffusion model. A restoration gap is estimated by a gap predictor which produces restoration gap guidance to refine a diffusion planner. We additionally present an attribution map regularizer to prevent adversarial refining guidance that could be generated from the sub-optimal gap predictor, which enables further refinement of infeasible plans. We demonstrate the effectiveness of our approach on three different benchmarks in offline control settings that require long-horizon planning. We also illustrate that our approach presents explainability by presenting the attribution maps of the gap predictor and highlighting error-prone transitions, allowing for a deeper understanding of the generated plans.
Kyowoon Lee, Seongun Kim, Jaesik Choi
NeurIPS2
2021 Explaining the Decisions of Deep Policy Networks for Robotic Manipulations
abstract
Deep policy networks enable robots to learn behaviors to solve various real-world complex tasks in an end-to-end fashion. However, they lack transparency to provide the reasons of actions. Thus, such a black-box model often results in low reliability and disruptive actions during the deployment of the robot in practice. To enhance its transparency, it is important to explain robot behaviors by considering the extent to which each input feature contributes to determining a given action. In this paper, we present an explicit analysis of deep policy models through input attribution methods to explain how and to what extent each input feature affects the decisions of the robot policy models. To this end, we present two methods for applying input attribution methods to robot policy networks: (1) we measure the importance factor of each joint torque to re ect the influence of the motor torque on the end-effector movement, and (2) we modify a relevance propagation method to handle negative inputs and outputs in deep policy networks properly. To the best of our knowledge, this is the first report to identify the dynamic changes of input attributions of multi-modal sensor inputs in deep policy networks online for robotic manipulation.
Seongun Kim, Jaesik Choi
IROS1