The Hilbert-Schmidt independence criterion (HSIC) is taken as an instance of the joint discrepancy $d$ to investigate the statistical efficiency of replacing the conditional formulation and attains fairness-accuracy tradeoffs comparable to conditional-route basel es while reducing per-epoch training time.
Abstract
Fair representation learning with a continuous sensitive attribute $S$ requires a representation $Z$ that is statistically independent of $S$. Existing criteria, including generalized demographic parity, the expectation of integral probability metrics (EIPM), and mutual information, enforce this independence by averaging a per-value discrepancy between the conditional law $P_{Z \mid S=s}$ and the marginal $P_Z$ over the law of $S$. This approach requires a nonparametric surrogate for the conditional law at each sensitive value. We propose evaluating independence through a single joint discrepancy $d\left(P_{Z, S}, P_Z \otimes P_S\right)$ between the joint law and the product of its marginals. We establish a disintegration identity; on decomposable witness classes it equals the conditional-integral functional that EIPM and generalized demographic parity instantiate. By reaching the same target without the conditional law, this discrepancy can be estimated directly from samples via a dependence statistic rather than conditional smoothing. We take the Hilbert-Schmidt independence criterion (HSIC) as an instance of the joint discrepancy $d$ to investigate the statistical efficiency of replacing the conditional formulation. The HSIC estimator is a closed-form $O\left(n^2\right)$ statistic that converges at the $O\left(n^{-1 / 2}\right)$ rate, in contrast to the nonparametric $O\left(n^{-2 / 5}\right)$ rate of the conditional-route estimators. We prove this instance is equivalent to the conditional maximum mean discrepancy (MMD) integral up to an explicit spectral tail. The corresponding algorithmic implementation, i.e., FRHSIC, attains fairness-accuracy tradeoffs comparable to conditional-route basel es while reducing per-epoch training time.
Understanding generalization of randomized learning algorithms remains a central challenge. Mutual-information and total-variation bounds provide complementary ways to quantify data--hypothesis dependence, but they can behave quite differently in high-dimensional regimes. We study a one-parameter family of dependence m...
Mohammad Hossein Momeni Hamaneh, M. M. Mojahedian, M. Yassaee· 0 citations
Information-theoretic generalization bounds usually control dependence on the task sample, whereas selective privacy may constrain only a different, private coordinate. We study i.i.d. pairs $(X,Y)$, where a learner observes $(X^n,Y^n)$, leaks at most $\epsilon_n$ nats about $X^n$, and incurs loss on $Y$. A chain-rule...
A. Zamani, Parastoo Sadeghi, Mikael Skoglund· 0 citations
The classical information bottleneck (IB) measures the relevance of a representation $U$ of $X$ to a target $Y$ by $I(U;Y)$, which does not directly characterize the error of downstream decisions. For a binary hypothesis $Y$ inferred from many separately encoded observations, the optimal error exponent is the Chernoff...
Loss-difference conditional mutual information (ld-CMI) uses the smallest of the standard observations in the supersample hierarchy of generalization bounds: it measures what a learner's loss differences reveal about which candidate of each pair it was trained on. Accuracy is known to force information into the model;...
Let $Y_1,\ldots,Y_n$ be independent symmetric random variables with log-concave tails. We give a dimension-free characterization of the expected supremum of the canonical process $X_x=\sum_{i=1}^n x_iY_i$ without any $\Delta_2$ or regular-growth assumption on the coordinate tails. The characterization is governed by sc...
It is proved that a deterministic order rule on $\mathbb R$ beats chance for every pair of distinct Borel probability measures and that no rule works for every distinct pair of distributions and every unknown unbalanced class prior.
K. Bleakley, Aaditya Ramdas· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.