A Data-Scalable Randomized Misfit Approach for Solving Large-Scale PDE-Constrained Inverse Problems
Ellen B. Le, Aaron Myers, Tan Bui-Thanh, Quoc P. Nguyen

TL;DR
This paper introduces a theory-based randomized misfit approach that efficiently solves large-scale PDE-constrained inverse problems with high-dimensional data, ensuring solution validity while reducing computational costs.
Contribution
It provides a novel theoretical framework for random projections in inverse problems, including broad feasible distributions and a new proof related to Johnson-Lindenstrauss lemma.
Findings
Validated the approach on elliptic PDE inverse problems
Demonstrated computational savings with high-dimensional data
Showed accuracy and viability of different random projections
Abstract
A randomized misfit approach is presented for the efficient solution of large-scale PDE-constrained inverse problems with high-dimensional data. The purpose of this paper is to offer a theory-based framework for random projections in this inverse problem setting. The stochastic approximation to the misfit is analyzed using random projection theory. By expanding beyond mean estimator convergence, a practical characterization of randomized misfit convergence can be achieved. The theoretical results developed hold with any valid random projection in the literature. The class of feasible distributions is broad yet simple to characterize compared to previous stochastic misfit methods. This class includes very sparse random projections which provide additional computational benefit. A different proof for a variant of the Johnson-Lindenstrauss lemma is also provided. This leads to a different…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
