Searcharxiv⌕ Search

arXiv subjects

Martha V. Sourla

Publications and source records attributed to Martha V. Sourla.

2 recordsLinked to original sources

Sequential Fairness Auditing with Limited Output Access

External evaluations are becoming increasingly central to the governance of AI systems. In practice, however, independent auditors often have limited access to deployed models and must rely on query-based interactions. Most existing fairness evaluation methods assume static datasets and fixed-sample statistical tests, making them poorly suited to real-world auditing scenarios in which evidence must be collected sequentially under query constraints. In this work, we formulate fairness auditing as a tolerance-aware sequential hypothesis-testing problem under limited model output access. We develop a sequential generalized likelihood-ratio framework that allows auditors to accumulate evidence from a finite audit pool and stop once sufficient support for compliance or violation has been obtained. The framework is instantiated for decision-based Statistical Parity and Equal Opportunity audits, and extended to score- and logit-based proxy audits when richer observables are available. Our results show that both the fairness metric and the level of model access significantly affect audit efficiency, and that the benefits of richer output information are not uniform across auditing settings. In particular, richer outputs can substantially reduce the number of queries required for some fairness metrics and operating regimes, while offering limited gains in near-threshold cases. This work provides a practical statistical framework for sequential fairness auditing under realistic deployment constraints.

cs.AI↗

Analyzing α-divergence in Gaussian Rate-Distortion-Perception Theory

The problem of estimating the information rate distortion perception function (RDPF), which is a relevant information-theoretic quantity in goal-oriented lossy compression and semantic information reconstruction, is investigated here. Specifically, we study the RDPF tradeoff for Gaussian sources subject to a mean-squared error (MSE) distortion and a perception measure that belongs to the family of α divergences. Assuming a jointly Gaussian RDPF, which forms a convex optimization problem, we characterize an upper bound for which we find a parametric solution. We show that evaluating the optimal parameters of this parametric solution is equivalent to finding the roots of a reduced exponential polynomial of degree α. Additionally, we determine which disjoint sets contain each root, which enables us to evaluate them numerically using the well-known bisection method. Finally, we validate our analytical findings with numerical results and establish connections with existing results.

cs.IT↗