REVIEW 2 cited by
Sequential Conditional Transport on Probabilistic Graphs for Interpretable Counterfactual Fairness
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
In this paper, we link two existing approaches to derive counterfactuals: adaptations based on a causal graph, and optimal transport. We extend "Knothe's rearrangement" and "triangular transport" to probabilistic graphical models, and use this counterfactual approach, referred to as sequential transport, to discuss fairness at the individual level. After establishing the theoretical foundations of the proposed method, we demonstrate its application through numerical experiments on both synthetic and real datasets.
Forward citations
Cited by 2 Pith papers
-
Lookahead Counterfactual Fairness
Lookahead counterfactual fairness requires that an individual's future status, not just the current decision, is equal in factual and counterfactual worlds; the paper gives a predictor that achieves this under linear ...
-
Perceived Fairness in Networks
Local neighbor comparisons can make a globally fair rule feel unfair, but the paper's main theorem does not actually prove the claimed linear amplification under demographic parity.
Discussion (0). Continue with ORCID to comment.