Bernard Haasdonk

Convergence Analysis of a Greedy Algorithm for Conditioning Gaussian Random Variables

Abstract In the context of Gaussian conditioning, greedy algorithms iteratively select the most informative measurements, given an observed Gaussian random variable. However, the convergence analysis for conditioning Gaussian random variables remains an open problem. We address t...