Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Aoqi Zuo

dblp:321/1755 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-author · 2 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
2 papers
Trustworthy machine learning · 92% Probabilistic and Bayesian machine learning · 8%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › fairness
causal fairness
0.812024
Interventional Fairness on Partially Known Causal Graphs: A Constrained Optimization Approach · ICLR 2024
Machine learning › Trustworthy machine learning
fairness
0.812024
Interventional Fairness on Partially Known Causal Graphs: A Constrained Optimization Approach · ICLR 2024
Machine learning › Trustworthy machine learning › fairness › causal fairness
counterfactual fairness
0.612022
Counterfactual Fairness with Partially Known Causal Graph · NeurIPS 2022
Mathematical optimization
constrained optimization
0.212024
Interventional Fairness on Partially Known Causal Graphs: A Constrained Optimization Approach · ICLR 2024
Machine learning › Probabilistic and Bayesian machine learning
causal inference
0.212022
Counterfactual Fairness with Partially Known Causal Graph · NeurIPS 2022

Methods — techniques the papers use, named apart from their topics

partially directed acyclic graph · 1.5causal inference · 1.5causal discovery · 0.6PDAG · 0.6
YearPublicationVenuePosition
2024 Interventional Fairness on Partially Known Causal Graphs: A Constrained Optimization Approach
abstract
Fair machine learning aims to prevent discrimination against individuals or sub-populations based on sensitive attributes such as gender and race. In recent years, causal inference methods have been increasingly used in fair machine learning to measure unfairness by causal effects. However, current methods assume that the true causal graph is given, which is often not true in real-world applications. To address this limitation, this paper proposes a framework for achieving causal fairness based on the notion of interventions when the true causal graph is partially known. The proposed approach involves modeling fair prediction using a Partially Directed Acyclic Graph (PDAG), specifically, a class of causal DAGs that can be learned from observational data combined with domain knowledge. The PDAG is used to measure causal fairness, and a constrained optimization problem is formulated to balance between fairness and accuracy. Results on both simulated and real-world datasets demonstrate the effectiveness of this method.
Aoqi Zuo, Yiqing Li 0002, Susan Wei, Mingming Gong
ICLR1
2022 Counterfactual Fairness with Partially Known Causal Graph
abstract
Fair machine learning aims to avoid treating individuals or sub-populations unfavourably based on \textit{sensitive attributes}, such as gender and race. Those methods in fair machine learning that are built on causal inference ascertain discrimination and bias through causal effects. Though causality-based fair learning is attracting increasing attention, current methods assume the true causal graph is fully known. This paper proposes a general method to achieve the notion of counterfactual fairness when the true causal graph is unknown. To select features that lead to counterfactual fairness, we derive the conditions and algorithms to identify ancestral relations between variables on a \textit{Partially Directed Acyclic Graph (PDAG)}, specifically, a class of causal DAGs that can be learned from observational data combined with domain knowledge. Interestingly, we find that counterfactual fairness can be achieved as if the true causal graph were fully known, when specific background knowledge is provided: the sensitive attributes do not have ancestors in the causal graph. Results on both simulated and real-world datasets demonstrate the effectiveness of our method.
Aoqi Zuo, Susan Wei, Tongliang Liu, Bo Han 0003, Kun Zhang 0001, Mingming Gong
NeurIPS1