Demo Data from EDBT 2026 / reviewers in the wild / expert
Zeqin Yang
dblp:326/4986
· DBLP profile ↗
7ranked-venue papers
0as first author
7since 2021 · last 2025
0009-0004-3343-4195ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 7 · 7 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Databases, data management, data science and information retrieval · 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
5 papers |
Probabilistic and Bayesian machine learning · 83% Representation and self-supervised learning · 9% Reinforcement learning · 8% | |
| Theoretical computer science
3 papers |
Mathematical optimization · 100% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning
causal inference |
4.0 | 5 | 2025 | Long-Term Individual Causal Effect Estimation via Identifiable Latent Representation Learning · IJCAI 2025 Reducing Confounding Bias without Data Splitting for Causal Inference via Optimal Transport · ICML 2025 Reducing Balancing Error for Causal Inference via Optimal Transport · ICML 2024 |
Mathematical optimization
optimal transport |
2.4 | 3 | 2025 | Reducing Confounding Bias without Data Splitting for Causal Inference via Optimal Transport · ICML 2025 Reducing Balancing Error for Causal Inference via Optimal Transport · ICML 2024 Exploiting Geometry for Treatment Effect Estimation via Optimal Transport · AAAI 2024 |
Machine learning › Probabilistic and Bayesian machine learning › causal inference
confounding bias |
1.6 | 2 | 2025 | Reducing Confounding Bias without Data Splitting for Causal Inference via Optimal Transport · ICML 2025 Reducing Balancing Error for Causal Inference via Optimal Transport · ICML 2024 |
Machine learning › Representation and self-supervised learning › causal representation learning › identifiability
identifiable representation learning |
0.9 | 1 | 2025 | Long-Term Individual Causal Effect Estimation via Identifiable Latent Representation Learning · IJCAI 2025 |
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal effect estimation › treatment effect estimation
individual treatment effect estimation |
0.9 | 1 | 2025 | Long-Term Individual Causal Effect Estimation via Identifiable Latent Representation Learning · IJCAI 2025 |
Machine learning › Probabilistic and Bayesian machine learning › causal inference
causal effect estimation |
0.8 | 1 | 2024 | Doubly Robust Causal Effect Estimation under Networked Interference via Targeted Learning · ICML 2024 |
Machine learning › Reinforcement learning › off-policy evaluation
doubly robust estimation |
0.8 | 1 | 2024 | Doubly Robust Causal Effect Estimation under Networked Interference via Targeted Learning · ICML 2024 |
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal effect estimation
treatment effect estimation |
0.8 | 1 | 2024 | Exploiting Geometry for Treatment Effect Estimation via Optimal Transport · AAAI 2024 |
Methods — techniques the papers use, named apart from their topics
optimal transport · 4.8balanced representation learning · 1.7wasserstein discrepancy · 1.5reweighting · 1.5projected mirror descent · 1.5variational autoencoder · 0.9targeted learning · 0.8semiparametric estimation · 0.8neural network · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Reducing Confounding Bias without Data Splitting for Causal Inference via Optimal TransportabstractCausal inference seeks to estimate the effect given a treatment such as a medicine or the dosage of a medication. To reduce the confounding bias caused by the non-randomized treatment assignment, most existing methods reduce the shift between subpopulations receiving different treatments. However, these methods split limited training samples into smaller groups, which cuts down the number of samples in each group, while precise distribution estimation and alignment highly rely on a sufficient number of training samples. In this paper, we propose a distribution alignment paradigm without data splitting, which can be naturally applied in the settings of binary and continuous treatments. To this end, we characterize the confounding bias by considering different probability measures of the same set including all the training samples, and exploit the optimal transport theory to analyze the confounding bias and outcome estimation error. Based on this, we propose to learn balanced representations by reducing the bias between the marginal distribution and the conditional distribution of a treatment. As a result, data reduction caused by splitting is avoided, and the outcome prediction model trained on one treatment group can be generalized to the entire population. The experiments on both binary and continuous treatment settings demonstrate the effectiveness of our method. Yuguang Yan, Zongyu Li, Zeqin Yang, Ruichu Cai |
ICML | 4 |
| 2025 | Long-Term Individual Causal Effect Estimation via Identifiable Latent Representation LearningabstractEstimating long-term causal effects by combining long-term observational and short-term experimental data is a crucial but challenging problem in many real-world scenarios. In existing methods, several ideal assumptions, e.g. latent unconfoundedness assumption or additive equi-confounding bias assumption, are proposed to address the latent confounder problem raised by the observational data. However, in real-world applications, these assumptions are typically violated which limits their practical effectiveness. In this paper, we tackle the problem of estimating the long-term individual causal effects without the aforementioned assumptions. Specifically, we propose to utilize the natural heterogeneity of data, such as data from multiple sources, to identify latent confounders, thereby significantly avoiding reliance on idealized assumptions. Practically, we devise a latent representation learning-based estimator of long-term causal effects. Theoretically, we establish the identifiability of latent confounders, with which we further achieve long-term effect identification. Extensive experimental studies, conducted on multiple synthetic and semi-synthetic datasets, demonstrate the effectiveness of our proposed method. Ruichu Cai, Junjie Wan, Weilin Chen 0001, Zeqin Yang, Zijian Li 0001, Peng Zhen 0001, Jiecheng Guo |
IJCAI | 4 |
| 2024 | Exploiting Geometry for Treatment Effect Estimation via Optimal TransportabstractEstimating treatment effects from observational data suffers from the issue of confounding bias, which is induced by the imbalanced confounder distributions between the treated and control groups. As an effective approach, re-weighting learns a group of sample weights to balance the confounder distributions. Existing methods of re-weighting highly rely on a propensity score model or moment alignment. However, for complex real-world data, it is difficult to obtain an accurate propensity score prediction. Although moment alignment is free of learning a propensity score model, accurate estimation for high-order moments is computationally difficult and still remains an open challenge, and first and second-order moments are insufficient to align the distributions and easy to be misled by outliers. In this paper, we exploit geometry to capture the intrinsic structure involved in data for balancing the confounder distributions, so that confounding bias can be reduced even with outliers. To achieve this, we construct a connection between treatment effect estimation and optimal transport, a powerful tool to capture geometric information. After that, we propose an optimal transport model to learn sample weights by extracting geometry from confounders, in which geometric information between groups and within groups is leveraged for better confounder balancing. A projected mirror descent algorithm is employed to solve the derived optimization problem. Experimental studies on both synthetic and real-world datasets demonstrate the effectiveness of our proposed method. Yuguang Yan, Zeqin Yang, Weilin Chen 0001, Ruichu Cai, Michael Kwok-Po Ng |
AAAI | 2 |
| 2024 | Doubly Robust Causal Effect Estimation under Networked Interference via Targeted LearningabstractCausal effect estimation under networked interference is an important but challenging problem. Available parametric methods are limited in their model space, while previous semiparametric methods, e.g., leveraging neural networks to fit only one single nuisance function, may still encounter misspecification problems under networked interference without appropriate assumptions on the data generation process. To mitigate bias stemming from misspecification, we propose a novel doubly robust causal effect estimator under networked interference, by adapting the targeted learning technique to the training of neural networks. Specifically, we generalize the targeted learning technique into the networked interference setting and establish the condition under which an estimator achieves double robustness. Based on the condition, we devise an end-to-end causal effect estimator by transforming the identified theoretical condition into a targeted loss. Moreover, we provide a theoretical analysis of our designed estimator, revealing a faster convergence rate compared to a single nuisance model. Extensive experimental results on two real-world networks with semisynthetic data demonstrate the effectiveness of our proposed estimators. Weilin Chen 0001, Ruichu Cai, Zeqin Yang, Jie Qiao, Yuguang Yan, Zijian Li 0001, Zhifeng Hao 0004 |
ICML | 3 |
| 2024 | Reducing Balancing Error for Causal Inference via Optimal TransportabstractMost studies on causal inference tackle the issue of confounding bias by reducing the distribution shift between the control and treated groups. However, it remains an open question to adopt an appropriate metric for distribution shift in practice. In this paper, we define a generic balancing error on reweighted samples to characterize the confounding bias, and study the connection between the balancing error and the Wasserstein discrepancy derived from the theory of optimal transport. We not only regard the Wasserstein discrepancy as the metric of distribution shift, but also explore the association between the balancing error and the underlying cost function involved in the Wasserstein discrepancy. Motivated by this, we propose to reduce the balancing error under the framework of optimal transport with learnable marginal distributions and the cost function, which is implemented by jointly learning weights and representations associated with factual outcomes. The experiments on both synthetic and real-world datasets demonstrate the effectiveness of our proposed method. Yuguang Yan, Zeqin Yang, Weilin Chen 0001, Ruichu Cai |
ICML | 3 |
| 2024 | Long-term causal effects estimation via latent surrogates representation learning
Ruichu Cai, Weilin Chen 0001, Zeqin Yang, Shu Wan 0002, Jiecheng Guo |
Neural Networks | 3 |
| 2023 | Generalization Bound for Estimating Causal Effects from Observational Network DataabstractEstimating causal effects from observational network data is a significant but challenging problem. Existing works in causal inference for observational network data lack an analysis of the generalization bound, which can theoretically provide support for alleviating the complex confounding bias and practically guide the design of learning objectives in a principled manner. To fill this gap, we derive a generalization bound for causal effect estimation in network scenarios by exploiting 1) the reweighting schema based on joint propensity score and 2) the representation learning schema based on Integral Probability Metric (IPM). We provide two perspectives on the generalization bound in terms of reweighting and representation learning, respectively. Motivated by the analysis of the bound, we propose a weighting regression method based on the joint propensity score augmented with representation learning. Extensive experimental studies on two real-world networks with semi-synthetic data demonstrate the effectiveness of our algorithm. Ruichu Cai, Zeqin Yang, Weilin Chen 0001, Yuguang Yan, Zhifeng Hao 0005 |
CIKM | 2 |