Pith. sign in

REVIEW 3 cited by

Towards Fairness-Aware Adversarial Learning

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

arxiv 2402.17729 v2 pith:QREWTOID submitted 2024-02-27 cs.CV

classification cs.CV
keywords robustadversarialmodelfaalfairnesslearningperformancerobustness
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Although adversarial training (AT) has proven effective in enhancing the model's robustness, the recently revealed issue of fairness in robustness has not been well addressed, i.e. the robust accuracy varies significantly among different categories. In this paper, instead of uniformly evaluating the model's average class performance, we delve into the issue of robust fairness, by considering the worst-case distribution across various classes. We propose a novel learning paradigm, named Fairness-Aware Adversarial Learning (FAAL). As a generalization of conventional AT, we re-define the problem of adversarial training as a min-max-max framework, to ensure both robustness and fairness of the trained model. Specifically, by taking advantage of distributional robust optimization, our method aims to find the worst distribution among different categories, and the solution is guaranteed to obtain the upper bound performance with high probability. In particular, FAAL can fine-tune an unfair robust model to be fair within only two epochs, without compromising the overall clean and robust accuracies. Extensive experiments on various image datasets validate the superior performance and efficiency of the proposed FAAL compared to other state-of-the-art methods.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Margin-Adaptive Confidence Ranking for Reliable LLM Judgement

    cs.LG 2026-05 unverdicted novelty 5.0 of 10

    Introduces a margin-adaptive confidence ranking method that learns an estimator from simulated diversity and derives margin-dependent generalization bounds for use in fixed-sequence testing of LLM-human agreement.

  2. Margin-Adaptive Confidence Ranking for Reliable LLM Judgement

    cs.LG 2026-05 conditional novelty 5.0 of 10

    Learning a margin-based confidence ranker for LLM judges improves agreement-target success in cascaded selective evaluation compared to heuristic confidence scores.

  3. Margin-Adaptive Confidence Ranking for Reliable LLM Judgement

    cs.LG 2026-05 unverdicted novelty 4.0 of 10

    Develops a margin-adaptive learned confidence estimator for LLMs with generalization guarantees to improve agreement rates with human judgments over heuristic baselines.

Pith tools