Constrained Reweighting of Distributions: an Optimal Transport Approach
Abhisek Chakraborty, Anirban Bhattacharya, Debdeep Pati
TL;DR
The paper tackles reweighting empirical distributions under flexible distributional constraints by marrying maximum entropy with optimal transport, specifically using the $W_2$ distance to a target distribution. It develops a distribution-guided constrained entropy framework that yields a discrete, weight-adjusted empirical measure closely aligned with a (potentially continuous) target, with departures controlled by a tuning parameter. The authors instantiate the approach in three domains: semi-parametric inference for complex surveys (via bootstrapped distributionally constrained models and ETEL), demographic parity in machine learning (through in-model and two-step fairness schemes leveraging $W_2$ constraints), and entropy-based portfolio optimization (using Skew-normal targets to balance diversification and fidelity). Across these applications, the method demonstrates improved inference accuracy, fairness, and diversification trade-offs, while providing a versatile, interpretable framework for data re-weighting under side constraints.
Abstract
We commonly encounter the problem of identifying an optimally weight adjusted version of the empirical distribution of observed data, adhering to predefined constraints on the weights. Such constraints often manifest as restrictions on the moments, tail behaviour, shapes, number of modes, etc., of the resulting weight adjusted empirical distribution. In this article, we substantially enhance the flexibility of such methodology by introducing a nonparametrically imbued distributional constraints on the weights, and developing a general framework leveraging the maximum entropy principle and tools from optimal transport. The key idea is to ensure that the maximum entropy weight adjusted empirical distribution of the observed data is close to a pre-specified probability distribution in terms of the optimal transport metric while allowing for subtle departures. The versatility of the framework is demonstrated in the context of three disparate applications where data re-weighting is warranted to satisfy side constraints on the optimization problem at the heart of the statistical task: namely, portfolio allocation, semi-parametric inference for complex surveys, and ensuring algorithmic fairness in machine learning algorithms.
