This paper is concerned with an inverse source problem for the stochastic wave equation driven by a fractional Brownian motion. Given the random source, the direct problem is to study the solution of the stochastic wave equation. The inverse problem is to determine the statistical properties of the source from the expectation and covariance of the final-time data. For the direct problem, it is shown to be well-posed with a unique mild solution. For the inverse problem, the uniqueness is proved for a certain class of functions and the instability is characterized. Numerical experiments are presented to illustrate the reconstructions by using a truncation-based regularization method.
We propose a stochastic gradient descent approach with partitioned-truncated singular value decomposition for large-scale inverse problems of magnetic modulus data. Motivated by a uniqueness theorem in gravity inverse problem and realizing the similarity between gravity and magnetic inverse problems, we propose to solve the level-set function modeling the volume susceptibility distribution from the nonlinear magnetic modulus data. To deal with large-scale data, we employ a mini-batch stochastic gradient descent approach with random reshuffling when solving the optimization problem of the inver…
In this work, we investigate the regularized solutions and their finite element solutions to the inverse source problems governed by partial differential equations, and establish the stochastic convergence and optimal finite element convergence rates of these solutions, under pointwise measurement data with random noise. Unlike most existing regularization theories, the regularization error estimates are derived without any source conditions, while the error estimates of finite element solutions show their explicit dependence on the noise level, regularization parameter, mesh size, and time st…
Physics-informed neural network (PINN) has been successfully applied in solving a variety of nonlinear non-convex forward and inverse problems. However, the training is challenging because of the non-convex loss functions and the multiple optima in the Bayesian inverse problem. In this work, we propose a multi-variance replica exchange stochastic gradient Langevin diffusion method to tackle the challenge of the multiple local optima in the optimization and the challenge of the multiple modal posterior distribution in the inverse problem. Replica exchange methods are capable of escaping from th…
Stochastic variance reduced gradient (SVRG) is a popular variance reduction technique for accelerating stochastic gradient descent (SGD). We provide a first analysis of the method for solving a class of linear inverse problems in the lens of the classical regularization theory. We prove that for a suitable constant step size schedule, the method can achieve an optimal convergence rate in terms of the noise level (under suitable regularity condition) and the variance of the SVRG iterate error is smaller than that by SGD. These theoretical findings are corroborated by a set of numerical experime…
Shanghai Normal University（上海师范大学）；Tongji University（同济大学）；Academy of Mathematics and Systems Science, Chinese Academy of Sciences（中国科学院数学与系统科学研究院）
We introduce in this work the normalizing field flows (NFF) for learning random fields from scattered measurements. More precisely, we construct a bijective transformation (a normalizing flow characterizing by neural networks) between a Gaussian random field with the Karhunen-Loève (KL) expansion structure and the target stochastic field, where the KL expansion coefficients and the invertible networks are trained by maximizing the sum of the log-likelihood on scattered measurements. This NFF model can be used to solve data-driven forward, inverse, and mixed forward/inverse stochastic partial d…
We introduce Stochastic Asymptotical Regularization (SAR) methods for the uncertainty quantification of the stable approximate solution of ill-posed linear-operator equations, which are deterministic models for numerous inverse problems in science and engineering. We prove the regularizing properties of SAR with regard to mean-square convergence. We also show that SAR is an optimal-order regularization method for linear ill-posed problems provided that the terminating time of SAR is chosen according to the smoothness of the solution. This result is proven for both a priori and a posteriori sto…
In this paper, we consider the inverse eigenvalue problem for the positive doubly stochastic matrices, which aims to construct a positive doubly stochastic matrix from the prescribed realizable spectral data. By using the real Schur decomposition, the inverse problem is written as a nonlinear matrix equation on a matrix product manifold. We propose monotone and nonmonotone Riemannian inexact Newton-CG methods for solving the nonlinear matrix equation. The global and quadratic convergence of the proposed methods is established under some assumptions. We also provide invariant subspaces of the c…
Stochastic gradient descent (SGD) is a promising method for solving large-scale inverse problems, due to its excellent scalability with respect to data size. The current mathematical theory in the lens of regularization theory predicts that SGD with a polynomially decaying stepsize schedule may suffer from an undesirable saturation phenomenon, i.e., the convergence rate does not further improve with the solution regularity index when it is beyond a certain range. In this work, we present a refined convergence rate analysis of SGD, and prove that saturation actually does not occur if the initia…
A new sufficient condition for a list of real numbers to be the spectrum of a symmetric doubly stochastic matrix is presented; this is a contribution to the classical spectral inverse problem for symmetric doubly stochastic matrices that is still open in its full generality. It is proved that whenever $λ_2, \ldots, λ_n$ are non-positive real numbers with $1 + λ_2 + \ldots + λ_n \geqslant 1/2$, then there exists a symmetric, doubly stochastic matrix whose spectrum is precisely $(1, λ_2, \ldots, λ_n)$. We point out that this criterion is incomparable to the classical sufficient conditions due to…
Methods have been developed to identify the probability distribution of a random vector $Z$ from information consisting of its bounded range and the probability density function or moments of a quantity of interest, $Q(Z)$. The mapping from $Z$ to $Q(Z)$ may arise from a stochastic differential equation whose coefficients depend on $Z$. This problem differs from Bayesian inverse problems as the latter is primarily driven by observation noise. We motivate this work by demonstrating that additional information on $Z$ is required to recover its true law. Our objective is to identify what addition…
We derive an efficient stochastic algorithm for inverse problems that present an unknown linear forcing term and a set of nonlinear parameters to be recovered. It is assumed that the data is noisy and that the linear part of the problem is ill-posed. The vector of nonlinear parameters to be recovered is modeled as a random variable. This random vector is augmented by a random regularization parameter for the linear part. A probability distribution function for this augmented random vector knowing the measurements is derived. The derivation is based on the maximum likelihood regularization para…
We consider a stochastic gradient descent (SGD) algorithm for solving linear inverse problems (e.g., CT image reconstruction) in the Banach space framework of variable exponent Lebesgue spaces $\ell^{(p_n)}(\mathbb{R})$. Such non-standard spaces have been recently proved to be the appropriate functional framework to enforce pixel-adaptive regularisation in signal and image processing applications. Compared to its use in Hilbert settings, however, the application of SGD in the Banach setting of $\ell^{(p_n)}(\mathbb{R})$ is not straightforward, due, in particular to the lack of a closed-form ex…
The stochastic inverse eigenvalue problem aims to reconstruct a stochastic matrix from its spectrum. While there exists a large literature on the existence of solutions for special settings, there are only few numerical solution methods available so far. Recently, Zhao et al. (2016) proposed a constrained optimization model on the manifold of so-called isospectral matrices and adapted a modified Polak-Ribière-Polyak conjugate gradient method to the geometry of this manifold. However, not every stochastic matrix is an isospectral one and the model from Zhao et al. is based on the assumption tha…
In this work, we analyze the regularizing property of the stochastic gradient descent for the efficient numerical solution of a class of nonlinear ill-posed inverse problems in Hilbert spaces. At each step of the iteration, the method randomly chooses one equation from the nonlinear system to obtain an unbiased stochastic estimate of the gradient, and then performs a descent step with the estimated gradient. It is a randomized version of the classical Landweber method for nonlinear inverse problems, and it is highly scalable to the problem size and holds significant potentials for solving larg…
A general stochastic algorithm for solving mixed linear and nonlinear problems was introduced in [11]. We show in this paper how it can be used to solve the fault inverse problem, where a planar fault in elastic half-space and a slip on that fault have to be reconstructed from noisy surface displacement measurements. With the parameter giving the plane containing the fault denoted by m and the regularization parameter for the linear part of the inverse problem denoted by C, both modeled as random variables, we derive a formula for the posterior marginal of m. Modeling C as a random variable al…
A computational framework for infinite-dimensional Bayesian inverse problems: Part II. Stochastic Newton MCMC with application to ice sheet flow inverse problems
Sediment Concentration Estimation via Multiscale Inverse Problem and Stochastic Homogenization
Tsinghua University（清华大学）；Yau Mathematical Sciences Center, Tsinghua University（丘成桐数学科学中心）；Yanqi Lake Beijing Institute of Mathematical Sciences and Applications（北京雁栖湖应用数学研究院）；Ningxia University（宁夏大学）；Xiangtan University（湘潭大学）；City University of Hong Kong（香港城市大学）
This paper is concerned with the inverse random source problem for a stochastic time fractional diffusion equation, where the source is assumed to be driven by a Gaussian random field. The direct problem is shown to be well-posed by examining the well-posedness and regularity of the solution for the equivalent stochastic two-point boundary value problem in the frequency domain. For the inverse problem, the Fourier modulus of the diffusion coefficient of the random source is proved to be uniquely determined by the variance of the Fourier transform of the boundary data. As a phase retrieval for …
In many applications, Bayesian inverse problems can give rise to probability distributions which contain complexities due to the Hessian varying greatly across parameter space. This complexity often manifests itself as lower dimensional manifolds on which the likelihood function is invariant, or varies very little. This can be due to trying to infer unobservable parameters, or due to sloppiness in the model which is being used to describe the data. In such a situation, standard sampling methods for characterising the posterior distribution, which do not incorporate information about this struc…
The trace of a matrix function f(A), most notably of the matrix inverse, can be estimated stochastically using samples< x,f(A)x> if the components of the random vectors x obey an appropriate probability distribution. However such a Monte-Carlo sampling suffers from the fact that the accuracy depends quadratically of the samples to use, thus making higher precision estimation very costly. In this paper we suggest and investigate a multilevel Monte-Carlo approach which uses a multigrid hierarchy to stochastically estimate the trace. This results in a substantial reduction of the variance, so tha…
