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

Dohun Lim

dblp:289/1154 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 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
2 papers
Trustworthy machine learning · 67% Reinforcement learning · 33%
Computer graphics and multimedia
1 paper
Computer animation and physical simulation · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › continuous control
physics-based motion control
1.012026
BRIC: Bridging Kinematic Plans and Physical Control at Test Time · AAAI 2026
Computer animation and physical simulation › motion synthesis
human motion synthesis
1.012026
BRIC: Bridging Kinematic Plans and Physical Control at Test Time · AAAI 2026
Machine learning › Trustworthy machine learning › robustness
adversarial examples
0.512021
Building Reliable Explanations of Unreliable Neural Networks: Locally Smoothing Perspective of Model Interpretation · CVPR 2021
Machine learning › Trustworthy machine learning
interpretability
0.512021
Building Reliable Explanations of Unreliable Neural Networks: Locally Smoothing Perspective of Model Interpretation · CVPR 2021
Machine learning › Trustworthy machine learning
robustness
0.512021
Building Reliable Explanations of Unreliable Neural Networks: Locally Smoothing Perspective of Model Interpretation · CVPR 2021
Machine learning › Trustworthy machine learning › interpretability › visual explanation
saliency map
0.512021
Building Reliable Explanations of Unreliable Neural Networks: Locally Smoothing Perspective of Model Interpretation · CVPR 2021

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

test-time adaptation · 2.0reinforcement learning · 2.0diffusion model · 2.0local smoothing · 0.5l1 regularization · 0.5
YearPublicationVenuePosition
2026 BRIC: Bridging Kinematic Plans and Physical Control at Test Time
abstract
We propose BRIC, a novel test-time adaptation (TTA) framework that enables long-term human motion generation by resolving execution discrepancies between diffusion-based kinematic motion planners and reinforcement learning-based physics controllers. While diffusion models can generate diverse and expressive motions conditioned on text and scene context, they often produce physically implausible outputs, leading to execution drift during simulation. To address this, BRIC dynamically adapts the physics controller to noisy motion plans at test time, while preserving pre-trained skills via a loss function that mitigates catastrophic forgetting. In addition, BRIC introduces a lightweight test-time guidance mechanism that steers the diffusion model in the signal space without updating its parameters. By combining both adaptation strategies, BRIC ensures consistent and physically plausible long-term executions across diverse environments in an effective and efficient manner. We validate the effectiveness of BRIC on a variety of long-term tasks, including motion composition, obstacle avoidance, and human-scene interaction, achieving state-of-the-art performance across all tasks.
Dohun Lim, Jaewoon Lim, Sungchan Kim
AAAI1
2021 Building Reliable Explanations of Unreliable Neural Networks: Locally Smoothing Perspective of Model Interpretation
abstract
We present a novel method for reliably explaining the predictions of neural networks. We consider an explanation reliable if it identifies input features relevant to the model output by considering the input and the neighboring data points. Our method is built on top of the assumption of smooth landscape in a loss function of the model prediction: locally consistent loss and gradient profile. A theoretical analysis established in this study suggests that those locally smooth model explanations are learned using a batch of noisy copies of the input with the L1 regularization for a saliency map. Extensive experiments support the analysis results, revealing that the proposed saliency maps retrieve the original classes of adversarial examples crafted against both naturally and adversarially trained models, significantly outperforming previous methods. We further demonstrated that such good performance results from the learning capability of this method to identify input features that are truly relevant to the model output of the input and the neighboring data points, fulfilling the requirements of a reliable explanation.
Dohun Lim, Sungchan Kim
CVPR1