Metraipolis › archive › dc_f9bef205d3f0

Partial identification with entropy regularized optimal transport — arXiv:2609.40156

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.40156
License (as archived)
CC0-1.0
Archived
2026-10-07T14:13:15.063Z
SHA-256 of the archived text
c6ae9270b22a7005ffaaa86c3506519709727894b1b8d9a553d6ebd1759df0d4
Stable URL of this page
https://metraipolis.com/documento/dc_f9bef205d3f0

How to cite

Partial identification with entropy regularized optimal transport — arXiv:2609.40156 — arXiv (en), https://arxiv.org/abs/2609.40156 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f9bef205d3f0 (Metraipolis archive dc_f9bef205d3f0, sha256 c6ae9270b22a7005ffaaa86c3506519709727894b1b8d9a553d6ebd1759df0d4)
BibTeX
@misc{dcf9bef205d3f0,
  title = {Partial identification with entropy regularized optimal transport — arXiv:2609.40156},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.40156},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f9bef205d3f0; sha256 c6ae9270b22a7005ffaaa86c3506519709727894b1b8d9a553d6ebd1759df0d4},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.40156. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In many statistical settings, the available data and maintained assumptions do not suffice to uniquely identify the model parameters of interest. In such cases, one can only identify sets which are guaranteed to contain the true parameters. These are often characterized through linear programs that optimize over models compatible with the observed data. These programs can be infinite-dimensional in the optimizer and the number of constraints. We provide a unified way to characterize and solve such optimization problems by phrasing them as optimal transport problems on path spaces. This allows us to regularize the problem with an entropy penalty, recasting it as a multi-marginal entropic optimal transport problem, which can be solved efficiently via Sinkhorn iterations. In addition, it allows us to establish convergence of the regularized value to the sharpest bound, derive consistency rates for a plug-in estimator, and obtain asymptotic distribution for approximate bounds. The method is general and accommodates settings ranging from instrumental variable models with continuous variables to welfare estimation in heterogeneous demand models. We verify the statistical and computational properties in simulations and provide an application to demand estimation.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in math.ST).
Categorie arXiv: Econometrics (econ.EM) ; Statistics Theory (math.ST); Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2609.40156 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T14:03:45.761Z dalla pagina https://arxiv.org/catchup/math.ST/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).