IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2610.04146.html

Partial Identification under Imperfect Measurement: A Distributionally Robust Approach

Author

Listed:
  • Isaac Meza

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.

Suggested Citation

  • Isaac Meza, 2026. "Partial Identification under Imperfect Measurement: A Distributionally Robust Approach," Papers 2610.04146, arXiv.org.
    • Handle: RePEc:arx:papers:2610.04146
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2610.04146
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Charles F. Manski, 1989. "Anatomy of the Selection Problem," Journal of Human Resources, University of Wisconsin Press, vol. 24(3), pages 343-360.
    2. Rui Gao & Anton Kleywegt, 2023. "Distributionally Robust Stochastic Optimization with Wasserstein Distance," Mathematics of Operations Research, INFORMS, vol. 48(2), pages 603-655, May.
    3. Jose Blanchet & Karthyek Murthy, 2019. "Quantifying Distributional Model Risk via Optimal Transport," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 565-600, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yang Liu & Qiuqi Wang & Yihan Wang, 2026. "Robust distortion riskmetrics under Wasserstein ambiguity," Papers 2610.09622, arXiv.org.
    2. Florian F Gunsilius, 2025. "A primer on optimal transport for causal inference with observational data," Papers 2503.07811, arXiv.org, revised Aug 2026.
    3. Blessing, Jonas & Kupper, Michael & Sgarabottolo, Alessandro, 2025. "Discrete approximation of risk-based prices under volatility uncertainty," Center for Mathematical Economics Working Papers 742, Center for Mathematical Economics, Bielefeld University.
    4. Ling Liang & Zusen Xu & Kim-Chuan Toh & Jia-Jie Zhu, 2025. "An Inexact Halpern Iteration with Application to Distributionally Robust Optimization," Journal of Optimization Theory and Applications, Springer, vol. 206(3), pages 1-41, September.
    5. Tadao Hoshino, 2025. "Evaluating Policy Effects under Network Interference without Network Information: A Transfer Learning Approach," Papers 2510.14415, arXiv.org.
    6. Bo Rao & Liu Yang & Jingmin Cai, 2025. "Optimal transport-based distributionally robust optimization with polynomial uncertainty," Journal of Global Optimization, Springer, vol. 93(1), pages 215-240, September.
    7. Ruonan Xu & Xiye Yang, 2025. "Distributionally Robust Treatment Effect," Papers 2512.12781, arXiv.org, revised Apr 2026.
    8. Birghila, Corina & Aigner, Maximilian & Engelke, Sebastian, 2025. "Distributionally robust tail bounds based on Wasserstein distance and f-divergence," Insurance: Mathematics and Economics, Elsevier, vol. 125(C).
    9. Chung-Han Hsieh, 2026. "Sampled-Data Wasserstein Distributionally Robust Control of Multiplicative Systems: A Convex Relaxation with Performance Guarantees," Papers 2602.04219, arXiv.org.
    10. Anand Deo, 2025. "EVT-Based Rate-Preserving Distributional Robustness for Tail Risk Functionals," Papers 2506.16230, arXiv.org, revised Jan 2026.
    11. Hong T. M. Chu & Meixia Lin & Kim-Chuan Toh, 2026. "Wasserstein Distributionally Robust Optimization and Its Tractable Regularization Formulation," Journal of Optimization Theory and Applications, Springer, vol. 208(2), pages 1-28, February.
    12. Victor Aguirregabiria, 2006. "Another Look at the Identification of Dynamic Discrete Decision Processes: With an Application to Retirement Behavior," 2006 Meeting Papers 169, Society for Economic Dynamics.
    13. Christian Bontemps & Thierry Magnac & Eric Maurin, 2012. "Set Identified Linear Models," Econometrica, Econometric Society, vol. 80(3), pages 1129-1155, May.
    14. Marlon R. Moresco & Mélina Mailhot & Silvana M. Pesenti, 2025. "Uncertainty Propagation and Dynamic Robust Risk Measures," Mathematics of Operations Research, INFORMS, vol. 50(3), pages 1939-1964, August.
    15. Vikesh Amin & Jere R. Behrman & Jason M. Fletcher & Carlos A. Flores & Alfonso Flores-Lagunes & Hans-Peter Kohler, 2022. "Does Schooling Improve Cognitive Abilities at Older Ages: Causal Evidence from Nonparametric Bounds," PIER Working Paper Archive 22-016, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
    16. van der Klaauw, Bas & Koning, Ruud H, 2003. "Testing the Normality Assumption in the Sample Selection Model with an Application to Travel Demand," Journal of Business & Economic Statistics, American Statistical Association, vol. 21(1), pages 31-42, January.
    17. Giorgio Brunello & Dimitris Christelis & Anna Sanz‐de‐Galdeano & Anastasia Terskaya, 2024. "Does college selectivity reduce obesity? A partial identification approach," Health Economics, John Wiley & Sons, Ltd., vol. 33(10), pages 2306-2320, October.
    18. Mullahy, John, 2024. "Analyzing health outcomes measured as bounded counts," Journal of Health Economics, Elsevier, vol. 95(C).
    19. van Soest, Arthur & Hurd, Michael, 2008. "A Test for Anchoring and Yea-Saying in Experimental Consumption Data," Journal of the American Statistical Association, American Statistical Association, vol. 103, pages 126-136, March.
    20. Jose Blanchet & Henry Lam & Yang Liu & Ruodu Wang, 2025. "Convolution Bounds on Quantile Aggregation," Operations Research, INFORMS, vol. 73(5), pages 2761-2781, September.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2610.04146. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.