Robust estimation of graphical models with measurement error: False discovery control and sensitivity analysis

Shira Mingelgrin, Y. Samuel Wang
Proceedings of the 42nd Conference on Uncertainty in Artificial Intelligence, PMLR 337:4528-4542, 2026.

Abstract

This paper addresses the problem of learning {Gaussian} graphical models from data contaminated by additive measurement error. Applying traditional procedures to the noisy data may result in many false discoveries. On the other hand, existing procedures that explicitly account for measurement error assume that the measurement error covariance is known or can be estimated precisely. We provide two practical alternatives for the common setting where this side information is not available. The first proposed method follows a partial identification approach and estimates a graph with controlled false discovery rate when given an upper bound on the measurement error variances. In many settings, the precise variance of the errors is unknown, but the scientist may still confidently specify an upper bound. The second framework is a sensitivity analysis that assesses the minimum amount of measurement error required to explain away an estimated edge. This yields an interpretable measure for practitioners to assess which estimated edges are robust and which may be simply due to measurement error. We derive theoretical guarantees and show good empirical performance in simulations. We further illustrate the practical utility of our procedures on a single-cell mRNA sequencing dataset.

Cite this Paper

BibTeX
@InProceedings{pmlr-v337-mingelgrin26a, title = {Robust estimation of graphical models with measurement error: False discovery control and sensitivity analysis}, author = {Mingelgrin, Shira and Wang, Y. Samuel}, booktitle = {Proceedings of the 42nd Conference on Uncertainty in Artificial Intelligence}, pages = {4528--4542}, year = {2026}, editor = {Perković, Emilija and Malinsky, Daniel}, volume = {337}, series = {Proceedings of Machine Learning Research}, month = {17--21 Aug}, publisher = {PMLR}, pdf = {https://raw.githubusercontent.com/mlresearch/v337/main/assets/mingelgrin26a/mingelgrin26a.pdf}, url = {https://proceedings.mlr.press/v337/mingelgrin26a.html}, abstract = {This paper addresses the problem of learning {Gaussian} graphical models from data contaminated by additive measurement error. Applying traditional procedures to the noisy data may result in many false discoveries. On the other hand, existing procedures that explicitly account for measurement error assume that the measurement error covariance is known or can be estimated precisely. We provide two practical alternatives for the common setting where this side information is not available. The first proposed method follows a partial identification approach and estimates a graph with controlled false discovery rate when given an upper bound on the measurement error variances. In many settings, the precise variance of the errors is unknown, but the scientist may still confidently specify an upper bound. The second framework is a sensitivity analysis that assesses the minimum amount of measurement error required to explain away an estimated edge. This yields an interpretable measure for practitioners to assess which estimated edges are robust and which may be simply due to measurement error. We derive theoretical guarantees and show good empirical performance in simulations. We further illustrate the practical utility of our procedures on a single-cell mRNA sequencing dataset.} }
Endnote
%0 Conference Paper %T Robust estimation of graphical models with measurement error: False discovery control and sensitivity analysis %A Shira Mingelgrin %A Y. Samuel Wang %B Proceedings of the 42nd Conference on Uncertainty in Artificial Intelligence %C Proceedings of Machine Learning Research %D 2026 %E Emilija Perković %E Daniel Malinsky %F pmlr-v337-mingelgrin26a %I PMLR %P 4528--4542 %U https://proceedings.mlr.press/v337/mingelgrin26a.html %V 337 %X This paper addresses the problem of learning {Gaussian} graphical models from data contaminated by additive measurement error. Applying traditional procedures to the noisy data may result in many false discoveries. On the other hand, existing procedures that explicitly account for measurement error assume that the measurement error covariance is known or can be estimated precisely. We provide two practical alternatives for the common setting where this side information is not available. The first proposed method follows a partial identification approach and estimates a graph with controlled false discovery rate when given an upper bound on the measurement error variances. In many settings, the precise variance of the errors is unknown, but the scientist may still confidently specify an upper bound. The second framework is a sensitivity analysis that assesses the minimum amount of measurement error required to explain away an estimated edge. This yields an interpretable measure for practitioners to assess which estimated edges are robust and which may be simply due to measurement error. We derive theoretical guarantees and show good empirical performance in simulations. We further illustrate the practical utility of our procedures on a single-cell mRNA sequencing dataset.
APA
Mingelgrin, S. & Wang, Y.S.. (2026). Robust estimation of graphical models with measurement error: False discovery control and sensitivity analysis. Proceedings of the 42nd Conference on Uncertainty in Artificial Intelligence, in Proceedings of Machine Learning Research 337:4528-4542 Available from https://proceedings.mlr.press/v337/mingelgrin26a.html.

Related Material