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

HyeongJoo Hwang

dblp:280/1199 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
5since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 6 · 3 first-author · 5 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
6 papers
Reinforcement learning · 58% Representation and self-supervised learning · 20% Generative modeling · 9%

Topics — the 11 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
imitation learning
2.032024
Mitigating Covariate Shift in Behavioral Cloning via Robust Stationary Distribution Correction · NeurIPS 2024
Regularized Behavior Cloning for Blocking the Leakage of Past Action Information · NeurIPS 2023
DemoDICE: Offline Imitation Learning with Supplementary Imperfect Demonstrations · ICLR 2022
Machine learning › Reinforcement learning › imitation learning › offline imitation learning
behavior cloning
1.422024
Mitigating Covariate Shift in Behavioral Cloning via Robust Stationary Distribution Correction · NeurIPS 2024
Regularized Behavior Cloning for Blocking the Leakage of Past Action Information · NeurIPS 2023
Machine learning › Reinforcement learning › imitation learning
offline imitation learning
1.322024
Mitigating Covariate Shift in Behavioral Cloning via Robust Stationary Distribution Correction · NeurIPS 2024
DemoDICE: Offline Imitation Learning with Supplementary Imperfect Demonstrations · ICLR 2022
Machine learning › Representation and self-supervised learning › multi-view learning
multi-view representation learning
1.222023
Information-Theoretic State Space Model for Multi-View Reinforcement Learning · ICML 2023
Multi-View Representation Learning via Total Correlation Objective · NeurIPS 2021
Machine learning › Generative modeling
variational autoencoder
0.922021
Multi-View Representation Learning via Total Correlation Objective · NeurIPS 2021
Variational Interaction Information Maximization for Cross-domain Disentanglement · NeurIPS 2020
Machine learning › Transfer learning and domain adaptation › domain shift
covariate shift
0.812024
Mitigating Covariate Shift in Behavioral Cloning via Robust Stationary Distribution Correction · NeurIPS 2024
Machine learning › Reinforcement learning › representation learning for control
multi-view reinforcement learning
0.712023
Information-Theoretic State Space Model for Multi-View Reinforcement Learning · ICML 2023
Machine learning › Deep learning architectures and training
state space model
0.712023
Information-Theoretic State Space Model for Multi-View Reinforcement Learning · ICML 2023
Machine learning › Reinforcement learning › imitation learning
learning from imperfect demonstrations
0.612022
DemoDICE: Offline Imitation Learning with Supplementary Imperfect Demonstrations · ICLR 2022
Machine learning › Representation and self-supervised learning › representation learning › disentangled representation learning
cross-domain disentanglement
0.412020
Variational Interaction Information Maximization for Cross-domain Disentanglement · NeurIPS 2020
Machine learning › Representation and self-supervised learning › representation learning
disentangled representation learning
0.412020
Variational Interaction Information Maximization for Cross-domain Disentanglement · NeurIPS 2020

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

information theory · 1.1variational inference · 0.9stationary distribution correction · 0.8distributionally robust optimization · 0.8state space model · 0.7kernel-based estimator · 0.7conditional independence · 0.7offline RL · 0.6distribution correction estimation · 0.6total correlation · 0.5
YearPublicationVenuePosition
2024 Mitigating Covariate Shift in Behavioral Cloning via Robust Stationary Distribution Correction
abstract
We consider offline imitation learning (IL), which aims to train an agent to imitate from the dataset of expert demonstrations without online interaction with the environment. Behavioral Cloning (BC) has been a simple yet effective approach to offline IL, but it is also well-known to be vulnerable to the covariate shift resulting from the mismatch between the state distributions induced by the learned policy and the expert policy. Moreover, as often occurs in practice, when expert datasets are collected from an arbitrary state distribution instead of a stationary one, these shifts become more pronounced, potentially leading to substantial failures in existing IL methods. Specifically, we focus on covariate shift resulting from arbitrary state data distributions, such as biased data collection or incomplete trajectories, rather than shifts induced by changes in dynamics or noisy expert actions. In this paper, to mitigate the effect of the covariate shifts in BC, we propose DrilDICE, which utilizes a distributionally robust BC objective by employing a stationary distribution correction ratio estimation (DICE) to derive a feasible solution. We evaluate the effectiveness of our method through an extensive set of experiments covering diverse covariate shift scenarios. The results demonstrate the efficacy of the proposed approach in improving the robustness against the shifts, outperforming existing offline IL methods in such scenarios.
Seokin Seo, Byung-Jun Lee 0001, Jongmin Lee 0004, HyeongJoo Hwang, Hongseok Yang, Kee-Eung Kim
NeurIPS4
2023 Information-Theoretic State Space Model for Multi-View Reinforcement Learning
abstract
Multi-View Reinforcement Learning (MVRL) seeks to find an optimal control for an agent given multi-view observations from various sources. Despite recent advances in multi-view learning that aim to extract the latent representation from multi-view data, it is not straightforward to apply them to control tasks, especially when the observations are temporally dependent on one another. The problem can be even more challenging if the observations are intermittently missing for a subset of views. In this paper, we introduce Fuse2Control (F2C), an information-theoretic approach to capturing the underlying state space model from the sequences of multi-view observations. We conduct an extensive set of experiments in various control tasks showing that our method is highly effective in aggregating task-relevant information across many views, that scales linearly with the number of views while retaining robustness to arbitrary missing view scenarios.
HyeongJoo Hwang, Seokin Seo, Youngsoo Jang, Sungyoon Kim, Geon-Hyeong Kim, Seunghoon Hong, Kee-Eung Kim
ICML1
2023 Regularized Behavior Cloning for Blocking the Leakage of Past Action Information
abstract
For partially observable environments, imitation learning with observation histories (ILOH) assumes that control-relevant information is sufficiently captured in the observation histories for imitating the expert actions. In the offline setting wherethe agent is required to learn to imitate without interaction with the environment, behavior cloning (BC) has been shown to be a simple yet effective method for imitation learning. However, when the information about the actions executed in the past timesteps leaks into the observation histories, ILOH via BC often ends up imitating its own past actions. In this paper, we address this catastrophic failure by proposing a principled regularization for BC, which we name Past Action Leakage Regularization (PALR). The main idea behind our approach is to leverage the classical notion of conditional independence to mitigate the leakage. We compare different instances of our framework with natural choices of conditional independence metric and its estimator. The result of our comparison advocates the use of a particular kernel-based estimator for the conditional independence metric. We conduct an extensive set of experiments on benchmark datasets in order to assess the effectiveness of our regularization method. The experimental results show that our method significantly outperforms prior related approaches, highlighting its potential to successfully imitate expert actions when the past action information leaks into the observation histories.
Seokin Seo, HyeongJoo Hwang, Hongseok Yang, Kee-Eung Kim
NeurIPS2
2022 DemoDICE: Offline Imitation Learning with Supplementary Imperfect Demonstrations
Geon-Hyeong Kim, Seokin Seo, Jongmin Lee 0004, Wonseok Jeon, HyeongJoo Hwang, Hongseok Yang, Kee-Eung Kim
ICLR5
2021 Multi-View Representation Learning via Total Correlation Objective
abstract
Multi-View Representation Learning (MVRL) aims to discover a shared representation of observations from different views with the complex underlying correlation. In this paper, we propose a variational approach which casts MVRL as maximizing the amount of total correlation reduced by the representation, aiming to learn a shared latent representation that is informative yet succinct to capture the correlation among multiple views. To this end, we introduce a tractable surrogate objective function under the proposed framework, which allows our method to fuse and calibrate the observations in the representation space. From the information-theoretic perspective, we show that our framework subsumes existing multi-view generative models. Lastly, we show that our approach straightforwardly extends to the Partial MVRL (PMVRL) setting, where the observations are missing without any regular pattern. We demonstrate the effectiveness of our approach in the multi-view translation and classification tasks, outperforming strong baseline methods.
HyeongJoo Hwang, Geon-Hyeong Kim, Seunghoon Hong, Kee-Eung Kim
NeurIPS1
2020 Variational Interaction Information Maximization for Cross-domain Disentanglement
abstract
Cross-domain disentanglement is the problem of learning representations partitioned into domain-invariant and domain-specific representations, which is a key to successful domain transfer or measuring semantic distance between two domains. Grounded in information theory, we cast the simultaneous learning of domain-invariant and domain-specific representations as a joint objective of multiple information constraints, which does not require adversarial training or gradient reversal layers. We derive a tractable bound of the objective and propose a generative model named Interaction Information Auto-Encoder (IIAE). Our approach reveals insights on the desirable representation for cross-domain disentanglement and its connection to Variational Auto-Encoder (VAE). We demonstrate the validity of our model in the image-to-image translation and the cross-domain retrieval tasks. We further show that our model achieves the state-of-the-art performance in the zero-shot sketch based image retrieval task, even without external knowledge.
HyeongJoo Hwang, Geon-Hyeong Kim, Seunghoon Hong, Kee-Eung Kim
NeurIPS1