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.

Soungmin Park

dblp:441/9005 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 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
1 paper
Reinforcement learning · 83% Probabilistic and Bayesian machine learning · 17%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › multi-armed bandit › structured bandit
causal bandit
0.912025
Non-Stationary Structural Causal Bandits · NeurIPS 2025
Machine learning › Reinforcement learning
multi-armed bandit
0.912025
Non-Stationary Structural Causal Bandits · NeurIPS 2025
Machine learning › Reinforcement learning › multi-armed bandit
non-stationary bandits
0.912025
Non-Stationary Structural Causal Bandits · NeurIPS 2025
Machine learning › Probabilistic and Bayesian machine learning
causal inference
0.312025
Non-Stationary Structural Causal Bandits · NeurIPS 2025
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal model
structural causal model
0.312025
Non-Stationary Structural Causal Bandits · NeurIPS 2025

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

temporal causal model · 0.9minimal intervention set · 0.9
YearPublicationVenuePosition
2025 Non-Stationary Structural Causal Bandits
abstract
We study the problem of sequential decision-making in environments governed by evolving causal mechanisms. Prior work on structural causal bandits--formulations that integrate causal graphs into multi-armed bandit problems to guide intervention selection--has shown that leveraging the causal structure can reduce unnecessary interventions by identifying possibly-optimal minimal intervention sets (POMISs). However, such formulations fall short in dynamic settings where reward distributions may vary over time, as their static, hence myopic, nature focuses on immediate rewards and overlooks the long-term effects of interventions. In this work, we propose a non-stationary structural causal bandit framework that leverages temporal structural causal models to capture evolving dynamics over time. We characterize how interventions propagate over time by developing graphical tools and assumptions, which form the basis for identifying non-myopic intervention strategies. Within this framework, we devise POMIS$^+$, which captures the existence of variables that contribute to maximizing both immediate and long-term rewards. Our framework provides a principled way to reason about temporally-aware interventions by explicitly modeling information propagation across time. Empirical results validate the effectiveness of our approach, demonstrating improved performance over myopic baselines.
Yeahoon Kwon, Yesong Choe, Soungmin Park, Neil Dhir, Sanghack Lee
NeurIPS3