VLDB 2026 Research / reviewers in the wild / expert
Myunsoo Kim
dblp:76/10657
· DBLP profile ↗
3ranked-venue papers
2as first author
3since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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
2 papers |
Generative modeling · 70% Reinforcement learning · 30% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling
diffusion model |
0.9 | 1 | 2025 | Adaptive Non-Uniform Timestep Sampling for Accelerating Diffusion Model Training · CVPR 2025 |
Machine learning › Generative modeling › diffusion model
diffusion model training |
0.9 | 1 | 2025 | Adaptive Non-Uniform Timestep Sampling for Accelerating Diffusion Model Training · CVPR 2025 |
Machine learning › Reinforcement learning › hierarchical reinforcement learning
skill learning |
0.9 | 1 | 2025 | NBDI: A Simple and Effective Termination Condition for Skill Extraction from Task-Agnostic Demonstrations · ICML 2025 |
Machine learning › Generative modeling
timestep sampling |
0.9 | 1 | 2025 | Adaptive Non-Uniform Timestep Sampling for Accelerating Diffusion Model Training · CVPR 2025 |
Machine learning › Reinforcement learning
hierarchical reinforcement learning |
0.3 | 1 | 2025 | NBDI: A Simple and Effective Termination Condition for Skill Extraction from Task-Agnostic Demonstrations · ICML 2025 |
Methods — techniques the papers use, named apart from their topics
variance reduction · 0.9state-action novelty module · 0.9novelty estimation · 0.9non-uniform timestep sampling · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Learning to Process Relational Information for Cloud Computing Task Scheduling
Seong-Hyun Hong, Myunsoo Kim, Byung-Jun Lee 0001 |
Mach. Learn. | 2 |
| 2025 | Adaptive Non-Uniform Timestep Sampling for Accelerating Diffusion Model TrainingabstractAs a highly expressive generative model, diffusion models have demonstrated exceptional success across various domains, including image generation, natural language processing, and combinatorial optimization. However, as data distributions grow more complex, training these models to convergence becomes increasingly computationally intensive. While diffusion models are typically trained using uniform timestep sampling, our research shows that the variance in stochastic gradients varies significantly across timesteps, with high-variance timesteps becoming bottlenecks that hinder faster convergence. To address this issue, we introduce a non-uniform timestep sampling method that prioritizes these more critical timesteps. Our method tracks the impact of gradient updates on the objective for each timestep, adaptively selecting those most likely to minimize the objective effectively. Experimental results demonstrate that this approach not only accelerates the training process, but also leads to improved performance at convergence. Furthermore, our method shows robust performance across various datasets, scheduling strategies, and diffusion architectures, outperforming previously proposed timestep sampling and weighting heuristics that lack this degree of robustness. Myunsoo Kim, Donghyeon Ki, Seongwoong Shim, Byung-Jun Lee 0001 |
CVPR | 1 |
| 2025 | NBDI: A Simple and Effective Termination Condition for Skill Extraction from Task-Agnostic DemonstrationsabstractIntelligent agents are able to make decisions based on different levels of granularity and duration. Recent advances in skill learning enabled the agent to solve complex, long-horizon tasks by effectively guiding the agent in choosing appropriate skills. However, the practice of using fixed-length skills can easily result in skipping valuable decision points, which ultimately limits the potential for further exploration and faster policy learning.
In this work, we propose to learn a simple and effective termination condition that identifies decision points through a state-action novelty module that leverages agent experience data.
Our approach, Novelty-based Decision Point Identification (NBDI), outperforms previous baselines in complex, long-horizon tasks, and remains effective even in the presence of significant variations in the environment configurations of downstream tasks, highlighting the importance of decision point identification in skill learning. Myunsoo Kim, Hayeong Lee, Seongwoong Shim, JunHo Seo 0001, Byung-Jun Lee 0001 |
ICML | 1 |