arXiv Machine Learning By Maaya Sakata, Kazuto Fukuchi

Fair Classification with Efficient and Post-hoc Controllable Fairness-Accuracy Trade-off

Read the original on arXiv Machine Learning →

arXiv:2606. 28097v1 Announce Type: new Abstract: Post-hoc controllability of fair machine learning models, the ability to control the trade-off between fairness and accuracy after training, is valuable for practical deployment.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI
Aug 17

Training Fair Tabular Foundation Models

arXiv:2608. 14211v1 Announce Type: cross Abstract: Tabular Foundation Models (TFMs) have emerged as leading methods for tabular predictive tasks, leveraging in-context learning to predict on new data without task-specific training.

By Patrik Kenfack, Jesse C. Cresswell, Anthony L. Caterini, Samira Ebrahimi Kahou, Ulrich A\"ivodji
arXiv Machine Learning
Sep 23

FairMean: Promoting Fairness in Distributed Learning under Label Poisoning Attacks

FairMean is a new approach for distributed learning that addresses the conflict between fairness and robustness to label poisoning attacks. It assigns weights to client gradients based on a bounded, nondecreasing function of local loss, giving higher weight to high‑loss clients to promote fairness while limiting the influence of poisoned clients. The method is shown to improve fairness compared to standard average‑loss minimization and to reduce accuracy variance while boosting worst‑client accuracy in experiments.

By Huigan Zheng, Jiaojiao Zhang, Yongxiang Liu