ReLU integral probability metric and its applications
Not on the map. Why?
Abstract (arXiv)
We propose a parametric integral probability metric (IPM) to measure the discrepancy between two probability measures. The proposed IPM leverages a specific parametric family of discriminators, such as single-node neural networks with ReLU activation, to effectively distinguish between distributions, making it applicable in high-dimensional settings. By optimizing over the parameters of the chosen discriminator class, the proposed IPM demonstrates that its estimators have good convergence rates and can serve as a surrogate for other IPMs that use smooth nonparametric discriminator classes. We present an efficient algorithm for practical computation, offering a simple implementation and requiring fewer hyperparameters. Furthermore, we explore its applications in various tasks, such as covariate balancing for causal inference and fair representation learning. Across such diverse applications, we demonstrate that the proposed IPM provides strong theoretical guarantees, and empirical experiments show that it achieves comparable or even superior performance to other methods.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 55 of its 112 references that are in the map. First posted on arXiv 26 Apr 2025.
Builds on
55 of 112 references.
References · 55
- 2014Deep Learning Face Attributes in the Wildcited by 3,693
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2017Improved Training of Wasserstein GANscited by 2,235
- 2016Equality of Opportunity in Supervised Learningcited by 2,007
- 2019A Survey on Bias and Fairness in Machine Learningcited by 1,917
- 2017A Distributional Perspective on Reinforcement Learningcited by 765
- 2014Certifying and removing disparate impactcited by 715
- 2018A Reductions Approach to Fair Classificationcited by 587
- 2018Learning Adversarially Fair and Transferable Representationscited by 353
- 2018AI Fairness 360: An Extensible Toolkit for Detecting, Understanding, and Mitigating Unwanted Algorithmic Biascited by 319
- 2015Generative Moment Matching Networkscited by 257
- 2017MMD GAN: Towards Deeper Understanding of Moment Matching Networkcited by 254
38 more
- 2018Empirical Risk Minimization under Fairness Constraintscited by 226
- 2015The Variational Fair Autoencodercited by 223
- 2020A Survey on Causal Inferencecited by 202
- 2015Censoring Representations with an Adversarycited by 192
- 2021Causal Inference in Natural Language Processing: Estimation, Prediction, Interpretation and Beyondcited by 178
- 2019Fair Regression: Quantitative Definitions and Reduction-based Algorithmscited by 168
- 2021A survey on datasets for fairness-aware machine learningcited by 157
- 2021Rethinking Rotated Object Detection with Gaussian Wasserstein Distance Losscited by 156
- 2015Training generative neural networks via Maximum Mean Discrepancy optimizationcited by 151
- 2017Mind the Class Weight Bias: Weighted Maximum Mean Discrepancy for Unsupervised Domain Adaptationcited by 151
- 2019Wasserstein Fair Classificationcited by 131
- 2017Controllable Invariance through Adversarial Feature Learningcited by 127
- 2021Fair Mixup: Fairness via Interpolationcited by 109
- 2017Automated versus do-it-yourself methods for causal inference: Lessons learned from a data analysis competitioncited by 106
- 2020Fair Regression with Wasserstein Barycenterscited by 100
- 2016Fairness in Reinforcement Learningcited by 95
- 2019Wasserstein Dependency Measure for Representation Learningcited by 69
- 2016Balancing Covariates via Propensity Score Weightingcited by 65
- 2021Controllable Guarantees for Fair Outcomes via Contrastive Information Estimationcited by 45
- 2019Asymptotic Guarantees for Learning Generative Models with the Sliced-Wasserstein Distancecited by 43
- 2020Wasserstein Distances for Stereo Disparity Estimationcited by 38
- 2019Smooth function approximation by deep neural networks with general activation functionscited by 30
- 2017Sobolev GANcited by 29
- 2021Fair Representation Learning for Heterogeneous Information Networkscited by 28
- 2013Generalization Bounds for Domain Adaptationcited by 27
- 2019A Characteristic Function Approach to Deep Implicit Generative Modelingcited by 26
- 2025Distributional Diffusion Models with Scoring Rulescited by 25
- 2019On the Optimality of Gaussian Kernel Based Nonparametric Tests against Smooth Alternativescited by 21
- 2022Learning fair representation with a parametric integral probability metriccited by 20
- 2022Image-based Treatment Effect Heterogeneitycited by 20
- 2024Deep MMD Gradient Flow without adversarial trainingcited by 19
- 2024End-To-End Causal Effect Estimation from Unstructured Natural Language Datacited by 18
- 2023Optimal rates of approximation by shallow ReLUk neural networks and applications to nonparametric regressioncited by 15
- 2022MMD-B-Fair: Learning Fair Representations with Statistical Testingcited by 13
- 2020Multivariate goodness-of-Fit tests based on Wasserstein distancecited by 11
- 2019Wasserstein Distance Based Domain Adaptation for Object Detectioncited by 10
- 2022Fairness and Bias in Robot Learningcited by 10
- 2021Fair Tree Classifier using Strong Demographic Paritycited by 9
50 most cited of 55 All 55 (JSON)
Built on by
Citing papers per year: 2026: 1.
1 paper.