Pith. sign in

REVIEW 1 cited by

Active Fourier Auditor for Estimating Distributional Properties of ML Models

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 2410.08111 v1 pith:Q4OMLCFH submitted 2024-10-10 cs.LG cs.AIcs.CYstat.ML

classification cs.LGcs.AIcs.CYstat.ML
keywords propertiesfouriermodelmodelsauditactiveapproachauditing
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

With the pervasive deployment of Machine Learning (ML) models in real-world applications, verifying and auditing properties of ML models have become a central concern. In this work, we focus on three properties: robustness, individual fairness, and group fairness. We discuss two approaches for auditing ML model properties: estimation with and without reconstruction of the target model under audit. Though the first approach is studied in the literature, the second approach remains unexplored. For this purpose, we develop a new framework that quantifies different properties in terms of the Fourier coefficients of the ML model under audit but does not parametrically reconstruct it. We propose the Active Fourier Auditor (AFA), which queries sample points according to the Fourier coefficients of the ML model, and further estimates the properties. We derive high probability error bounds on AFA's estimates, along with the worst-case lower bounds on the sample complexity to audit them. Numerically we demonstrate on multiple datasets and models that AFA is more accurate and sample-efficient to estimate the properties of interest than the baselines.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. The Fair Game: Auditing & Debiasing AI Algorithms Over Time

    cs.AI 2025-08 unverdicted novelty 4.0 of 10

    Proposes 'Fair Game', a reinforcement-learning loop in which an auditor's bias criteria, updatable over time, steer a debiasing agent that adapts an ML model's predictions.

Pith tools