Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 7 min ago
PreprintCC BY 4.0arXiv

Partial Identification under Imperfect Measurement: A Distributionally Robust Approach

Abstract

Imperfect measurements allow different underlying distributions to generate the same observations. Restrictions linking unobserved components can make it difficult to characterize all compatible distributions and compute the resulting range of parameter values. We ask how to construct computable parameter bounds and tighten them without additional data or stronger assumptions. We develop a general framework for partial identification under imperfect measurement based on distributionally robust optimization. We use measurement restrictions to construct a neighborhood around a benchmark distribution, ensuring that every compatible distribution lies within it. Optimizing over this neighborhood gives parameter bounds through a common procedure that can be adapted to different measurement problems. The choice of benchmark affects how informative these bounds are. We establish conditions under which changing it can tighten the bounds while preserving every parameter value consistent with the same data and assumptions. Applications to networks, missing outcomes, and regression illustrate how the framework tightens bounds and can recover the full range of compatible values.

Related

  1. ROBUST BAYES TREATMENT CHOICE WITH PARTIAL IDENTIFICATION
    Andrés Aradillas Fernández, José Luis Montiel Olea, Chen Qiu +2
    Econometric TheoryPeer-reviewedCC BYFull text10 citedStatisticsOpenAlex
  2. Data-driven joint optimization of maintenance and spare parts provisioning: A distributionally robust approach
    Weijun Xie, Nagi Gebraeel, Stephen Robinson +1
    European Journal of Operational ResearchPeer-reviewedLicence not stated2 citedOptimisation & controlHAL
  3. Conservative neural posterior estimation via distributionally robust training
    William Laplante, Yuga Hikida, Charita Dellaporta +2
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  4. Optimality of Affine Policies in Distributionally Robust Linear-Quadratic Control with Temporally Correlated Noise
    Jakob Nylöf, Daniel Kuhn, John Lygeros +1
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  5. Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set
    Luhao Zhang, Shixiang Zhu
    arXivPreprintarXiv licenceFull textOptimisation & controlStatisticsarXiv
BibTeX
@misc{meza2026partial,
  title = {{Partial Identification under Imperfect Measurement: A Distributionally Robust Approach}},
  author = {Isaac Meza},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.04146},
  eprint = {2610.04146},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.04146},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Partial Identification under Imperfect Measurement: A Distributionally Robust Approach
AU  - Isaac Meza
PY  - 2026
DA  - 2026/10/02
PB  - arXiv
DO  - 10.48550/arxiv.2610.04146
UR  - https://arxiv.org/abs/2610.04146
AB  - Imperfect measurements allow different underlying distributions to generate the same observations. Restrictions linking unobserved components can make it difficult to characterize all compatible distributions and compute the resulting range of parameter values. We ask how to construct computable parameter bounds and tighten them without additional data or stronger assumptions. We develop a general framework for partial identification under imperfect measurement based on distributionally robust optimization. We use measurement restrictions to construct a neighborhood around a benchmark distribution, ensuring that every compatible distribution lies within it. Optimizing over this neighborhood gives parameter bounds through a common procedure that can be adapted to different measurement problems. The choice of benchmark affects how informative these bounds are. We establish conditions under which changing it can tighten the bounds while preserving every parameter value consistent with the same data and assumptions. Applications to networks, missing outcomes, and regression illustrate how the framework tightens bounds and can recover the full range of compatible values.
ER  -