paper-with-me

Papers

Fair Densities via Boosting the Sufficient Statistics of Exponential Families

2020-12-01 · Alexander Soen, Hisham Husain, Richard Nock

We introduce a boosting algorithm to pre-process data for fairness. Starting from an initial fair but inaccurate distribution, our approach shifts towards better data fitting while still ensuring a minimal fairness guarantee. To do so, it learns the sufficient statistics of an exponential family with boosting-compliant convergence. Importantly, we are able to theoretically prove that the learned distribution will have a representation rate and statistical rate data fairness guarantee. Unlike recent optimization based pre-processing methods, our approach can be easily adapted for continuous domain features. Furthermore, when the weak learners are specified to be decision trees, the sufficient statistics of the learned distribution can be examined to provide clues on sources of (un)fairness. Empirical results are present to display the quality of result on real-world data.

📄 PDF Abstract BibTeX arXiv:2012.00188

Code (1)

alexandersoen/fbde 공식 구현 pytorch

Tasks

Fairness

Methods 이 논문이 사용한 방법론

Interpretability 설명 없음

Similar Papers 제목 키워드 기반

Projected Boosting with Fairness Constraints: Quantifying the Cost of Fair Training Distributions

2026-02-05 · Amir Asiaee, Kaveh Aryan arxiv

Boosting algorithms enjoy strong theoretical guarantees: when weak learners maintain positive edge, AdaBoost achieves geometric decrease of exponential loss. We study how to incorporate group fairness constraints into bo…

Learning Games and Rademacher Observations Losses

2015-12-16 · Richard Nock

It has recently been shown that supervised learning with the popular logistic loss is equivalent to optimizing the exponential loss over sufficient statistics about the class: Rademacher observations (rados). We first sh…

Kernel Deformed Exponential Families for Sparse Continuous Attention

2021-11-01 · Alexander Moreno, Supriya Nagesh, Zhenke Wu, Walter Dempsey 외

Attention mechanisms take an expectation of a data representation with respect to probability weights. This creates summary statistics that focus on important features. Recently, (Martins et al. 2020, 2021) proposed cont…

Boosting Black Box Variational Inference

2018-06-06 · NeurIPS 2018 12 · Francesco Locatello, Gideon Dresdner, Rajiv Khanna, Isabel Valera 외

Approximating a probability density in a tractable manner is a central task in Bayesian statistics. Variational Inference (VI) is a popular technique that achieves tractability by choosing a relatively simple variational…

Variational Inference

Divergences induced by dual subtractive and divisive normalizations of exponential families and their convex deformations

2023-12-20 · Frank Nielsen

Exponential families are statistical models which are the workhorses in statistics, information theory, and machine learning among others. An exponential family can either be normalized subtractively by its cumulant or f…