Robust probabilistic inference via a constrained transport metric
Not on the map. Why?
Abstract (arXiv)
Flexible Bayesian models are typically constructed using limits of large parametric models with a multitude of parameters that are often uninterpretable. In this article, we offer a novel alternative by constructing an exponentially tilted empirical likelihood carefully designed to concentrate near a parametric family of distributions of choice with respect to a novel variant of the Wasserstein metric, which is then combined with a prior distribution on model parameters to obtain a robustified posterior. The proposed approach finds applications in a wide variety of robust inference problems, where we intend to perform inference on the parameters associated with the centering distribution in presence of outliers. Our proposed transport metric enjoys great computational simplicity, exploiting the Sinkhorn regularization for discrete optimal transport problems, and being inherently parallelizable. We demonstrate superior performance of our methodology when compared against state-of-the-art robust Bayesian inference methods. We also demonstrate equivalence of our approach with a nonparametric Bayesian formulation under a suitable asymptotic framework, testifying to its flexibility. The constrained entropy maximization that sits at the heart of our likelihood formulation finds its utility beyond robust Bayesian inference; an illustration is provided in a trustworthy machine learning application.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 26 of its 78 references that are in the map. First posted on arXiv 17 Mar 2023.
Builds on
26 of 78 references.
References · 26
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,053
- 2019Fair Regression: Quantitative Definitions and Reduction-based Algorithmscited by 168
- 2017Fair Inference On Outcomescited by 143
- 2019Wasserstein Fair Classificationcited by 131
- 2014Word Representations via Gaussian Embeddingcited by 96
- 2014Inconsistency of Bayesian Inference for Misspecified Linear Models, and a Proposal for Repairing Itcited by 92
- 2020Robust Optimization for Fairness with Noisy Protected Groupscited by 78
- 2019A Wasserstein-type distance in the space of Gaussian Mixture Modelscited by 75
- 2019Adversarially robust transfer learningcited by 66
- 2017On Formalizing Fairness in Prediction with Machine Learningcited by 65
- 2021Differential privacy and robust statistics in high dimensionscited by 64
14 more
- 2019Tree-Sliced Variants of Wasserstein Distancescited by 54
- 2017Assigning a value to a power likelihood in a general Bayesian modelcited by 46
- 2019Approximate Bayesian computation with the Wasserstein distancecited by 34
- 2015Robust Bayesian inference via coarseningcited by 32
- 2018Generalizing Point Embeddings using the Wasserstein Space of Elliptical Distributionscited by 20
- 2019Privacy-preserving parametric inference: a case for robust statisticscited by 17
- 2018A General Framework for Fair Regressioncited by 13
- 2018Distributionally Robust Optimization for Sequential Decision Makingcited by 11
- 2021Robust Fairness-aware Learning Under Sample Selection Biascited by 9
- 2014Robust and Scalable Bayes via a Median of Subset Posterior Measurescited by 8
- 2019Fair quantile regressioncited by 7
- 2023An MCMC Approach to Classical Estimationcited by 7
- 2020Finite mixture models do not reliably learn the number of componentscited by 6
- 2016Bayesian Estimation and Comparison of Moment Condition Modelscited by 4
Built on by
Citing papers per year: 2023: 1.
1 paper.