A Central Limit Theorem for L_p transportation cost with applications to Fairness Assessment in Machine Learning

07/18/2018
by   Eustasio del Barrio, et al.
0

We provide a Central Limit Theorem for the Monge-Kantorovich distance between two empirical distributions with size n and m, W_p(P_n,Q_m) for p>1 for observations on the real line, using a minimal amount of assumptions. We provide an estimate of the asymptotic variance which enables to build a two sample test to assess the similarity between two distributions. This test is then used to provide a new criterion to assess the notion of fairness of a classification algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/10/2011

A radial version of the Central Limit Theorem

In this note, we give a probabilistic interpretation of the Central Limi...
research
02/12/2021

Central Limit Theorems for General Transportation Costs

We consider the problem of optimal transportation with general cost betw...
research
05/19/2020

On the Theoretical Properties of the Exchange Algorithm

Exchange algorithm is one of the most popular extensions of Metropolis-H...
research
04/27/2023

Fairness Uncertainty Quantification: How certain are you that the model is fair?

Fairness-aware machine learning has garnered significant attention in re...
research
11/05/2019

Behavior of Fréchet mean and Central Limit Theorems on spheres

Jacobi fields are used to compute higher derivatives of the Fréchet func...
research
10/02/2022

A Kernel Measure of Dissimilarity between M Distributions

Given M ≥ 2 distributions defined on a general measurable space, we intr...
research
06/26/2019

An urn model with local reinforcement: a theoretical framework for a chi-squared goodness of fit test with a big sample

Motivated by recent studies of big samples, this work aims at constructi...

Please sign up or login with your details

Forgot password? Click here to reset