Teng Xiao

Teng Xiao

Auto-generated profile, based on publicly available information

Teng Xiao

The Pennsylvania State University, State College, PA, USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 October 2023
Verified
Conference Paper
Open access
ZGZhimeng Guo
Zhimeng Guo
JLJialiang Li
Jialiang Li
TXTeng Xiao
Teng Xiao
YMYao Ma
Yao Ma
SWSuhang Wang
Suhang Wang
Graph neural networks have shown great ability in representation (GNNs) learning on graphs, facilitating various tasks. Despite their great performance in modeling graphs, recent works show that GNNs tend to inherit and amplify the bias from training data, causing concerns of the adoption of GNNs in high-stake scenarios. Hence, many efforts have been taken for fairness-aware GNNs. However, most existing fair GNNs learn fair node representations by adopting statistical fairness notions, which may fail to alleviate bias in the presence of statistical anomalies. Motivated by causal theory, there are several attempts utilizing graph counterfactual fairness to mitigate root causes of unfairness. However, these methods suffer from non-realistic counterfactuals obtained by perturbation or generation. In this paper, we take a causal view on fair graph learning problem. Guided by the casual analysis, we propose a novel framework CAF, which can select counterfactuals from training data to avoid non-realistic counterfactuals and adopt selected counterfactuals to learn fair node representations for node classification task. Extensive experiments on synthetic and real-world datasets show the effectiveness of CAF. Our code is available at https://github.com/TimeLovercc/CAF-GNN.

4 August 2023
Verified
Conference Paper
Open access
TXTeng Xiao
Teng Xiao
ZCZhengyu Chen
Zhengyu Chen
SWSuhang Wang
Suhang Wang
This work studies the problem of learning unbiased algorithms from biased feedback for recommendation. We address this problem from a novel distribution shift perspective. Recent works in unbiased recommendation have advanced the state-of-the-art with various techniques such as re-weighting, multi-task learning, and meta-learning. Despite their empirical successes, most of them lack theoretical guarantees, forming non-negligible gaps between theories and recent algorithms. In this paper, we propose a theoretical understanding of why existing unbiased learning objectives work for unbiased recommendation. We establish a close connection between unbiased recommendation and distribution shift, which shows that existing unbiased learning objectives implicitly align biased training and unbiased test distributions. Built upon this connection, we develop two generalization bounds for existing unbiased learning methods and analyze their learning behavior. Besides, as a result of the distribution shift, we further propose a principled framework, Adversarial Self-Training (AST), for unbiased recommendation. Extensive experiments on real-world and semi-synthetic datasets demonstrate the effectiveness of AST.

22 April 2025
Verified
Conference Paper
Open access
JYJinluan Yang
Jinluan Yang
ZCZhengyu Chen
Zhengyu Chen
TXTeng Xiao
Teng Xiao
YLYong Lin
Yong Lin
WZWenqiao Zhang
Wenqiao Zhang
KKKun Kuang
Kun Kuang

10 November 2025
Verified
Conference Paper
Open access
YYYige Yuan
Yige Yuan
JZJunkai Zhou
Junkai Zhou
BXBingbing Xu
Bingbing Xu
LPLiang Pang
Liang Pang
DSDu Su
Du Su
XCXu Chen
Xu Chen

13 July 2025
Verified
Conference Paper
Open access
YYYige Yuan
Yige Yuan
BXBingbing Xu
Bingbing Xu
HTHexiang Tan
Hexiang Tan
FSFei Sun
Fei Sun
TXTeng Xiao
Teng Xiao
XCXueqi Cheng
Xueqi Cheng