activity
20162023
most citedDomain Adaptation with Conditional Distribution Matching and Generalized Label Shift

66 citations · 300 across the 29 of their papers we have counts for

collaborators

29 papers

cs.LG2023★ 4 cited

FFB: A Fair Fairness Benchmark for In-Processing Group Fairness Methods

Xiaotian Han, Jianfeng Chi, Yu Chen +4

This paper introduces the Fair Fairness Benchmark (\textsf{FFB}), a benchmarking framework for in-processing group fairness methods. Ensuring fairness in machine learning is import…

cs.LG2023★ 1 cited

Train Your Own GNN Teacher: Graph-Aware Distillation on Textual Graphs

Costas Mavromatis, Vassilis N. Ioannidis, Shen Wang +6

How can we learn effective node representations on textual graphs? Graph Neural Networks (GNNs) that use Language Models (LMs) to encode textual information of graphs achieve state…

cs.LG2022★ 1 cited

Greedy Modality Selection via Approximate Submodular Maximization

Runxiang Cheng, Gargi Balasubramaniam, Yifei He +2

Multimodal learning considers learning from multi-modality data, aiming to fuse heterogeneous sources of information. However, it is not always feasible to leverage all available m…

cs.CL2022★ 1 cited

Conditional Supervised Contrastive Learning for Fair Text Classification

Jianfeng Chi, William Shand, Yaodong Yu +3

Contrastive representation learning has gained much attention due to its superior performance in learning representations from both image and sequential data. However, the learned…

cs.LG2022★ 5 cited

Understanding Gradual Domain Adaptation: Improved Analysis, Optimal Path and Beyond

Haoxiang Wang, Bo Li, Han Zhao

The vast majority of existing algorithms for unsupervised domain adaptation (UDA) focus on adapting from a labeled source domain to an unlabeled target domain directly in a one-off…

cs.LG2022★ 5 cited

Conditional Contrastive Learning with Kernel

Yao-Hung Hubert Tsai, Tianqin Li, Martin Q. Ma +4

Conditional contrastive learning frameworks consider the conditional sampling procedure that constructs positive or negative data pairs conditioned on specific variables. Fair cont…

cs.LG2022★ 2 cited

Provable Domain Generalization via Invariant-Feature Subspace Recovery

Haoxiang Wang, Haozhe Si, Bo Li +1

Domain generalization asks for models trained over a set of training environments to perform well in unseen test environments. Recently, a series of algorithms such as Invariant Ri…

cs.LG2021★ 1 cited

FedMM: Saddle Point Optimization for Federated Adversarial Domain Adaptation

Yan Shen, Jian Du, Han Zhao +3

Federated adversary domain adaptation is a unique distributed minimax training task due to the prevalence of label imbalance among clients, with each client only seeing a subset of…

cs.LG2021★ 3 cited

Towards Return Parity in Markov Decision Processes

Jianfeng Chi, Jian Shen, Xinyi Dai +3

Algorithmic decisions made by machine learning models in high-stakes domains may have lasting impacts over time. However, naive applications of standard fairness criterion in stati…

cs.LG2021★ 6 cited

Bridging Multi-Task Learning and Meta-Learning: Towards Efficient Training and Effective Adaptation

Haoxiang Wang, Han Zhao, Bo Li

Multi-task learning (MTL) aims to improve the generalization of several related tasks by learning them jointly. As a comparison, in addition to the joint training scheme, modern me…

cs.LG2021★ 3 cited

Costs and Benefits of Fair Regression

Han Zhao

Real-world applications of machine learning tools in high-stakes domains are often regulated to be fair, in the sense that the predicted target should satisfy some quantitative not…

cs.LG2021

Invariant Information Bottleneck for Domain Generalization

Bo Li, Yifei Shen, Yezhen Wang +6

Invariant risk minimization (IRM) has recently emerged as a promising alternative for domain generalization. Nevertheless, the loss function is difficult to optimize for nonlinear…

cs.LG2021★ 6 cited

Quantifying and Improving Transferability in Domain Generalization

Guojun Zhang, Han Zhao, Yaoliang Yu +1

Out-of-distribution generalization is one of the key challenges when transferring a model from the lab to the real world. Existing efforts mostly focus on building invariant featur…

cs.LG2021★ 5 cited

Conditional Contrastive Learning for Improving Fairness in Self-Supervised Learning

Martin Q. Ma, Yao-Hung Hubert Tsai, Paul Pu Liang +4

Contrastive self-supervised learning (SSL) learns an embedding space that maps similar data pairs closer and dissimilar data pairs farther apart. Despite its success, one issue has…

cs.LG2021★ 4 cited

Self-supervised Representation Learning with Relative Predictive Coding

Yao-Hung Hubert Tsai, Martin Q. Ma, Muqiao Yang +3

This paper introduces Relative Predictive Coding (RPC), a new contrastive representation learning objective that maintains a good balance among training stability, minibatch size s…

cs.LG2021★ 5 cited

Understanding and Mitigating Accuracy Disparity in Regression

Jianfeng Chi, Yuan Tian, Geoffrey J. Gordon +1

With the widespread deployment of large-scale prediction systems in high-stakes domains, e.g., face recognition, criminal justice, etc., disparity in prediction accuracy between di…

cs.LG2020★ 10 cited

Fundamental Limits and Tradeoffs in Invariant Representation Learning

Han Zhao, Chen Dan, Bryon Aragam +3

A wide range of machine learning applications such as privacy-preserving learning, algorithmic fairness, and domain adaptation/generalization among others, involve learning invaria…

cs.LG2020★ 11 cited

Learning Invariant Representations and Risks for Semi-supervised Domain Adaptation

Bo Li, Yezhen Wang, Shanghang Zhang +4

The success of supervised learning hinges on the assumption that the training and test data come from the same underlying distribution, which is often not valid in practice due to…

cs.CV2020★ 23 cited

A Review of Single-Source Deep Unsupervised Visual Domain Adaptation

Sicheng Zhao, Xiangyu Yue, Shanghang Zhang +8

Large-scale labeled training datasets have enabled deep neural networks to excel across a wide range of benchmark vision tasks. However, in many applications, it is prohibitively e…

cs.LG2020★ 8 cited

Information Obfuscation of Graph Neural Networks

Peiyuan Liao, Han Zhao, Keyulu Xu +4

While the advent of Graph Neural Networks (GNNs) has greatly improved node and graph representation learning in many applications, the neighborhood aggregation scheme exposes addit…

cs.LG2020★ 6 cited

Neural Methods for Point-wise Dependency Estimation

Yao-Hung Hubert Tsai, Han Zhao, Makoto Yamada +2

Since its inception, the neural estimation of mutual information (MI) has demonstrated the empirical success of modeling expected dependency between high-dimensional random variabl…

cs.LG2020★ 66 cited

Domain Adaptation with Conditional Distribution Matching and Generalized Label Shift

Remi Tachet, Han Zhao, Yu-Xiang Wang +1

Adversarial learning has demonstrated good performance in the unsupervised domain adaptation setting, by learning domain-invariant representations. However, recent work has shown l…

stat.ML2019★ 27 cited

Continual Learning with Adaptive Weights (CLAW)

Tameem Adel, Han Zhao, Richard E. Turner

Approaches to continual learning aim to successfully learn a set of related tasks that arrive in an online manner. Recently, several frameworks have been developed which enable dee…

cs.LG2019★ 17 cited

Conditional Learning of Fair Representations

Han Zhao, Amanda Coston, Tameem Adel +1

We propose a novel algorithm for learning fair representations that can simultaneously mitigate two notions of disparity among different demographic subgroups in the classification…