mlsanityData to 14 Oct 2026

Is Fairness Truly Fair? Towards Reliable Lipschitz Fairness in Multi-Task Learning via Fixed-texorpdfstringδdelta Alignment

arXiv 2606.10632 ↗First posted 9 Jun 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Lipschitz-style individual fairness formalizes the idea that semantically similar examples should receive similar predictions, but its evaluation in multi-task learning (MTL) can be confounded by method-induced representation scales. This paper identifies threshold confounding: when the auditing tolerance is derived from each model's own representation distances, different algorithms are compared under different semantic thresholds. A threshold-drift analysis further shows how Bias rankings can change and identifies sufficient conditions for ranking preservation. We propose ReLiF, a reliability-aware framework that separates evaluation-time fixed-δ auditing from training-time controlled regularization. ReLiF uses a shared reference tolerance for comparable auditing and a violation-rate feedback controller to keep the Lipschitz surrogate active without letting it dominate stochastic training. This work also develops supporting analysis for threshold drift, reference-tolerance selection, and the relationship between the huberized training surrogate and its unsmoothed positive-margin counterpart. Experiments on clinical time-series benchmarks and NYUv2 (NYU Depth V2) dense prediction show that fixed-δ auditing exposes utility--fairness trade-offs that method-dependent thresholds can obscure. On NYUv2 with a ResNet50 backbone, ReLiF achieves competitive utility while substantially reducing aligned bias under shared fixed thresholds. On clinical benchmarks, ReLiF yields controlled fairness-regularized trade-offs, while fixed-δ auditing reveals that task-balancing baselines can sometimes achieve lower bias and that genuine utility--fairness trade-offs persist. These results support fixed-δ auditing as a semantically consistent protocol for evaluating Lipschitz fairness in MTL.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 24 of its 38 references that are in the map. First posted on arXiv 9 Jun 2026.

Builds on

24 of 38 references.

References · 24

  1. 2018Spectral Normalization for Generative Adversarial Networkscited by 1,636
  2. 2017Multi-Task Learning Using Uncertainty to Weigh Losses for Scene Geometry and Semanticscited by 1,358
  3. 2020Gradient Surgery for Multi-Task Learningcited by 1,256
  4. 2017GradNorm: Gradient Normalization for Adaptive Loss Balancing in Deep Multitask Networkscited by 834
  5. 2018Multi-Task Learning as Multi-Objective Optimizationcited by 821
  6. 2018End-to-End Multi-Task Learning with Attentioncited by 534
  7. 2021Conflict-Averse Gradient Descent for Multi-task Learningcited by 459
  8. 2017Multitask learning and benchmarking with clinical time series datacited by 290
  9. 2019Pareto Multi-Task Learningcited by 224
  10. 2018Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goalscited by 103
  11. 2022Learning Smooth Neural Functions via Lipschitz Regularizationcited by 86
  12. 2023FAMO: Fast Adaptive Multitask Optimizationcited by 78
12 more
  1. 2019Operationalizing Individual Fairness with Pairwise Fair Representationscited by 64
  2. 2018Two-Player Games for Efficient Non-Convex Constrained Optimizationcited by 55
  3. 2020Two Simple Ways to Learn Individual Fairness Metrics from Datacited by 54
  4. 2018Training Well-Generalizing Classifiers for Fairness Metrics and Other Data-Dependent Constraintscited by 53
  5. 2024FairMedFM: Fairness Benchmarking for Medical Imaging Foundation Modelscited by 47
  6. 2019A Principled Approach for Learning Task Similarity in Multitask Learningcited by 32
  7. 2023Some Fundamental Aspects about Lipschitz Continuity of Neural Networkscited by 26
  8. 2022Controlled Sparsity via Constrained Optimization or: How I Learned to Stop Tuning Penalties and Love Constraintscited by 25
  9. 2024Scalable Multitask Learning Using Gradient-based Estimation of Task Affinitycited by 20
  10. 2023Fairness in Multi-Task Learning via Wasserstein Barycenterscited by 14
  11. 2015Proximal gradient method for huberized support vector machinecited by 2
  12. 2023FERI: A Multitask-based Fairness Achieving Algorithm with Applications to Fair Organ Transplantationcited by 2

Built on by

Not cited yet.