← Search

Yuguang Yan

12 accepted papers

2026

Adjusting Prediction Model Through Wasserstein Geodesic for Causal Inference

ICLR 2026poster

Causal inference estimates the treatment effect by comparing the potential outcomes of the treated and control groups. Due to the existence of confounders, the distributions of treated and control groups are imbalanced, resulting in limited generalization ability of the outcome prediction model, \ie…

Cited by 0SourceScholar
2026

Matching without Group Barrier for Heterogeneous Treatment Effect Estimation

ICLR 2026poster

In heterogeneous treatment effect estimation from observational data, the fundamental challenge is that only the factual outcome under the received treatment is observable, while the potential outcomes under other treatments or no treatment can never be observed. As a simple and effective approach,…

Cited by 0SourceScholar
2025

Hypergraph Learning for Unsupervised Graph Alignment via Optimal Transport

AAAI 2025technical

Unsupervised graph alignment aims to find corresponding nodes across different graphs without supervision. Existing methods usually leverage the graph structure to aggregate features of nodes to find relations between nodes. However, the graph structure is inherently limited in pairwise relations be…

Cited by 0SourcePDFScholar
2025

Reducing Confounding Bias without Data Splitting for Causal Inference via Optimal Transport

ICML 2025poster

Causal 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, t…

Cited by 0SourcePDFScholar
2024

An Optimal Transport View for Subspace Clustering and Spectral Clustering

AAAI 2024technical

Clustering is one of the most fundamental problems in machine learning and data mining, and many algorithms have been proposed in the past decades. Among them, subspace clustering and spectral clustering are the most famous approaches. In this paper, we provide an explanation for subspace clustering…

Cited by 4SourcePDFScholar
2024

Doubly Robust Causal Effect Estimation under Networked Interference via Targeted Learning

ICML 2024oral

Causal 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 misspeci…

Cited by 8SourcePDFScholar
2024

Exploiting Geometry for Treatment Effect Estimation via Optimal Transport

AAAI 2024technical

Estimating 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 distr…

Cited by 3SourcePDFScholar
2024

Hypergraph Joint Representation Learning for Hypervertices and Hyperedges via Cross Expansion

AAAI 2024technical

Hypergraph captures high-order information in structured data and obtains much attention in machine learning and data mining. Existing approaches mainly learn representations for hypervertices by transforming a hypergraph to a standard graph, or learn representations for hypervertices and hyperedges…

Cited by 10SourcePDFScholar
2024

Reducing Balancing Error for Causal Inference via Optimal Transport

ICML 2024poster

Most 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…

Cited by 3SourcePDFScholar
2024

TNPAR: Topological Neural Poisson Auto-Regressive Model for Learning Granger Causal Structure from Event Sequences

AAAI 2024technical

Learning Granger causality from event sequences is a challenging but essential task across various applications. Most existing methods rely on the assumption that event sequences are independent and identically distributed (i.i.d.). However, this i.i.d. assumption is often violated due to the inhere…

Cited by 5SourcePDFScholar