Hugging Face Trending Papers

Robust Decentralized Fairness Auditing

arXiv Machine Learning
Oct 8

Robust Decentralized Fairness Auditing

arXiv:2610.10199v1 Announce Type: new Abstract: Emerging legislation requires large language models (LLMs) to be audited for compliance with regulatory standards, particularly fairness. Such black-bo...

By Sayan Biswas, Jade Garcia Bourr\'ee, Anne-Marie Kermarrec, Palak, Martijn de Vos
arXiv Machine Learning
Jun 17

Exposing the Illusion of Fairness: Auditing Vulnerabilities to Distributional Manipulation Attacks

arXiv:2507. 20708v3 Announce Type: replace Abstract: The rapid deployment of AI systems in high-stakes domains, including those classified as high-risk under the The EU AI Act (Regulation (EU) 2024/1689), has intensified the need for reliable compliance auditing.

By Valentin Lafargue, Adriana Laurindo Monteiro, Emmanuelle Claeys, Laurent Risser, Jean-Michel Loubes
arXiv Machine Learning
3d ago

Giskard : Byzantine Robust and Private Aggregation for Large-Scale Decentralized Learning

Giskard is a scalable protocol for private and Byzantine‑robust decentralized aggregation in large‑scale learning. It organizes participants into a tree of committees of size O(log n) and computes a differentially private coordinate‑wise approximate median using secure multi‑party computation within each committee. Experiments with up to one million participants show that Giskard reduces per‑party communication by nearly three orders of magnitude compared to its closest competitors while maintaining robustness against up to n/4 Byzantine parties.

By Ousmane Touat, C\'esar Sabater, Mohamed Maouche, Sonia Ben Mokhtar
arXiv AI
Sep 17

Pay Only for Disagreement: Certified No-Regression Verdicts for Model Updates with Matching Label-Complexity Bounds

The paper introduces DISCERN, a two-tier protocol for certifying that updates to production models do not increase risk. It first uses unlabeled data to detect benign updates based on disagreement rates, then selectively labels only disagreements through an anytime-valid confidence sequence. The method achieves finite-sample validity with label-complexity bounds of order ρ²/ε², demonstrating significant label savings and strong empirical performance across 14,000+ audit streams.

By Vishnu Bindu Balachandran