Demo Data from VLDB 2026 / reviewers in the wild / expert
Sorawit Saengkyongam
dblp:220/5469
· DBLP profile ↗
6ranked-venue papers
5as first author
5since 2021 · last 2024
0000-0003-1581-259XORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 6 · 5 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
5 papers |
Probabilistic and Bayesian machine learning · 32% Reinforcement learning · 31% Representation and self-supervised learning · 16% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Medical and health informatics · 100% |
Topics — the 15 heaviest of 15, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning
causal inference |
1.8 | 3 | 2024 | Effect-Invariant Mechanisms for Policy Generalization · J. Mach. Learn. Res. 2024 Exploiting Independent Instruments: Identification and Distribution Generalization · ICML 2022 Counterfactual Mean Embeddings · J. Mach. Learn. Res. 2021 |
Machine learning › Representation and self-supervised learning
causal representation learning |
0.8 | 1 | 2024 | Identifying Representations for Intervention Extrapolation · ICLR 2024 |
Machine learning › Representation and self-supervised learning › causal representation learning › identifiability
identifiable representation learning |
0.8 | 1 | 2024 | Identifying Representations for Intervention Extrapolation · ICLR 2024 |
Machine learning › Reinforcement learning › generalization in reinforcement learning
policy generalization |
0.8 | 1 | 2024 | Effect-Invariant Mechanisms for Policy Generalization · J. Mach. Learn. Res. 2024 |
Machine learning › Reinforcement learning
policy learning |
0.8 | 1 | 2024 | Effect-Invariant Mechanisms for Policy Generalization · J. Mach. Learn. Res. 2024 |
Machine learning › Reinforcement learning › bandit
contextual bandit |
0.7 | 1 | 2023 | Invariant Policy Learning: A Causal Perspective · IEEE Trans. Pattern Anal. Mach. Intell. 2023 |
Machine learning › Reinforcement learning › bandit › contextual bandit
offline contextual bandit |
0.7 | 1 | 2023 | Invariant Policy Learning: A Causal Perspective · IEEE Trans. Pattern Anal. Mach. Intell. 2023 |
Machine learning › Trustworthy machine learning
distributional shift |
0.6 | 1 | 2022 | Exploiting Independent Instruments: Identification and Distribution Generalization · ICML 2022 |
Machine learning › Probabilistic and Bayesian machine learning › causal inference
instrumental variable |
0.6 | 1 | 2022 | Exploiting Independent Instruments: Identification and Distribution Generalization · ICML 2022 |
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal effect estimation › treatment effect estimation
distributional treatment effect |
0.5 | 1 | 2021 | Counterfactual Mean Embeddings · J. Mach. Learn. Res. 2021 |
Machine learning › Kernel, tree and ensemble methods › kernel methods
kernel mean embedding |
0.5 | 1 | 2021 | Counterfactual Mean Embeddings · J. Mach. Learn. Res. 2021 |
Machine learning › Kernel, tree and ensemble methods
kernel methods |
0.5 | 1 | 2021 | Counterfactual Mean Embeddings · J. Mach. Learn. Res. 2021 |
Medical and health informatics › digital health
mobile health |
0.2 | 1 | 2024 | Effect-Invariant Mechanisms for Policy Generalization · J. Mach. Learn. Res. 2024 |
Machine learning › Trustworthy machine learning › robustness › distribution shift
robustness to distribution shift |
0.2 | 1 | 2023 | Invariant Policy Learning: A Causal Perspective · IEEE Trans. Pattern Anal. Mach. Intell. 2023 |
Machine learning › Optimization for machine learning
gradient-based learning |
0.2 | 1 | 2022 | Exploiting Independent Instruments: Identification and Distribution Generalization · ICML 2022 |
Methods — techniques the papers use, named apart from their topics
invariance testing · 1.5autoencoder · 0.8affine identifiability analysis · 0.8invariance · 0.7causality · 0.7independence restriction · 0.6HSIC-X · 0.6kernel mean embedding · 0.5RKHS · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Identifying Representations for Intervention ExtrapolationabstractThe premise of identifiable and causal representation learning is to improve the current representation learning paradigm in terms of generalizability or robustness. Despite recent progress in questions of identifiability, more theoretical results demonstrating concrete advantages of these methods for downstream tasks are needed. In this paper, we consider the task of intervention extrapolation: predicting how interventions affect an outcome, even when those interventions are not observed at training time, and show that identifiable representations can provide an effective solution to this task even if the interventions affect the outcome non-linearly. Our setup includes an outcome variable $Y$, observed features $X$, which are generated as a non-linear transformation of latent features $Z$, and exogenous action variables $A$, which influence $Z$. The objective of intervention extrapolation is then to predict how interventions on $A$ that lie outside the training support of $A$ affect $Y$. Here, extrapolation becomes possible if the effect of $A$ on $Z$ is linear and the residual when regressing Z on A has full support. As $Z$ is latent, we combine the task of intervention extrapolation with identifiable representation learning, which we call $\texttt{Rep4Ex}$: we aim to map the observed features $X$ into a subspace that allows for non-linear extrapolation in $A$. We show that the hidden representation is identifiable up to an affine transformation in $Z$-space, which, we prove, is sufficient for intervention extrapolation. The identifiability is characterized by a novel constraint describing the linearity assumption of $A$ on $Z$. Based on this insight, we propose a flexible method that enforces the linear invariance constraint and can be combined with any type of autoencoder. We validate our theoretical findings through a series of synthetic experiments and show that our approach can indeed succeed in predicting the effects of unseen interventions. Sorawit Saengkyongam, Elan Rosenfeld, Pradeep Ravikumar, Niklas Pfister, Jonas Peters |
ICLR | 1 |
| 2024 | Effect-Invariant Mechanisms for Policy GeneralizationabstractPolicy learning is an important component of many real-world learning systems. A major challenge in policy learning is how to adapt efficiently to unseen environments or tasks. Recently, it has been suggested to exploit invariant conditional distributions to learn models that generalize better to unseen environments. However, assuming invariance of entire conditional distributions (which we call full invariance) may be too strong of an assumption in practice. In this paper, we introduce a relaxation of full invariance called effect-invariance (e-invariance for short) and prove that it is sufficient, under suitable assumptions, for zero-shot policy generalization. We also discuss an extension that exploits e-invariance when we have a small sample from the test environment, enabling few-shot policy generalization. Our work does not assume an underlying causal graph or that the data are generated by a structural causal model; instead, we develop testing procedures to test e-invariance directly from data. We present empirical results using simulated data and a mobile health intervention dataset to demonstrate the effectiveness of our approach. Sorawit Saengkyongam, Niklas Pfister, Predrag V. Klasnja, Susan A. Murphy, Jonas Peters |
J. Mach. Learn. Res. | 1 |
| 2023 | Invariant Policy Learning: A Causal PerspectiveabstractContextual bandit and reinforcement learning algorithms have been successfully used in various interactive learning systems such as online advertising, recommender systems, and dynamic pricing. However, they have yet to be widely adopted in high-stakes application domains, such as healthcare. One reason may be that existing approaches assume that the underlying mechanisms are static in the sense that they do not change over different environments. In many real-world systems, however, the mechanisms are subject to shifts across environments which may invalidate the static environment assumption. In this paper, we take a step toward tackling the problem of environmental shifts considering the framework of offline contextual bandits. We view the environmental shift problem through the lens of causality and propose multi-environment contextual bandits that allow for changes in the underlying mechanisms. We adopt the concept of invariance from the causality literature and introduce the notion of policy invariance. We argue that policy invariance is only relevant if unobserved variables are present and show that, in that case, an optimal invariant policy is guaranteed to generalize across environments under suitable assumptions. Sorawit Saengkyongam, Nikolaj Thams, Jonas Peters, Niklas Pfister |
IEEE Trans. Pattern Anal. Mach. Intell. | 1 |
| 2022 | Exploiting Independent Instruments: Identification and Distribution GeneralizationabstractInstrumental variable models allow us to identify a causal function between covariates $X$ and a response $Y$, even in the presence of unobserved confounding. Most of the existing estimators assume that the error term in the response $Y$ and the hidden confounders are uncorrelated with the instruments $Z$. This is often motivated by a graphical separation, an argument that also justifies independence. Positing an independence restriction, however, leads to strictly stronger identifiability results. We connect to the existing literature in econometrics and provide a practical method called HSIC-X for exploiting independence that can be combined with any gradient-based learning procedure. We see that even in identifiable settings, taking into account higher moments may yield better finite sample results. Furthermore, we exploit the independence for distribution generalization. We prove that the proposed estimator is invariant to distributional shifts on the instruments and worst-case optimal whenever these shifts are sufficiently strong. These results hold even in the under-identified case where the instruments are not sufficiently rich to identify the causal function. Sorawit Saengkyongam, Leonard Henckel, Niklas Pfister, Jonas Peters |
ICML | 1 |
| 2021 | Counterfactual Mean EmbeddingsabstractCounterfactual inference has become a ubiquitous tool in online advertisement, recommendation systems, medical diagnosis, and econometrics. Accurate modelling of outcome distributions associated with different interventions---known as counterfactual distributions---is crucial for the success of these applications. In this work, we propose to model counterfactual distributions using a novel Hilbert space representation called counterfactual mean embedding (CME). The CME embeds the associated counterfactual distribution into a reproducing kernel Hilbert space (RKHS) endowed with a positive definite kernel, which allows us to perform causal inference over the entire landscape of the counterfactual distribution. Based on this representation, we propose a distributional treatment effect (DTE) which can quantify the causal effect over entire outcome distributions. Our approach is nonparametric as the CME can be estimated under the unconfoundedness assumption from observational data without requiring any parametric assumption about the underlying distributions. We also establish a rate of convergence of the proposed estimator which depends on the smoothness of the conditional mean and the Radon-Nikodym derivative of the underlying marginal distributions. Furthermore, our framework allows for more complex outcomes such as images, sequences, and graphs. Our experimental results on synthetic data and off-policy evaluation tasks demonstrate the advantages of the proposed estimator. Krikamol Muandet, Motonobu Kanagawa, Sorawit Saengkyongam, Sanparith Marukatat |
J. Mach. Learn. Res. | 3 |
| 2020 | Learning Joint Nonlinear Effects from Single-variable Interventions in the Presence of Hidden ConfoundersabstractWe propose an approach to estimate the effect of multiple simultaneous interventions in the presence of hidden confounders. To overcome the problem of hidden confounding, we consider the setting where we have access to not only the observational data but also sets of single-variable interventions in which each of the treatment variables is intervened on separately. We prove identifiability under the assumption that the data is generated from a nonlinear continuous structural causal model with additive Gaussian noise. In addition, we propose a simple parameter estimation method by pooling all the data from different regimes and jointly maximizing the combined likelihood. We also conduct comprehensive experiments to verify the identifiability result as well as to compare the performance of our approach against a baseline on both synthetic and real-world data. Sorawit Saengkyongam |
UAI | 1 |