27 January 2023 in SIAM Journal on Scientific Computing
The tensor-train (TT) format is a highly compact low-rank representation for high-dimensional tensors. TT is particularly useful when representing approximations to the solutions of certa...
31 March 2023 in SIAM Journal on Applied Dynamical Systems
We study an optimal transportation approach for recovering parameters in dynamical systems with a single smoothly varying attractor. We assume that the data are not sufficient for estimating time derivatives of state variables but enough to approximate the long-time behavior of the system through an approximation of its physical measure. Thus, we fit physical measures by taking the Wasserstein distance from optimal transportation as a misfit function between two probability distributions. In particular, we analyze the regularity of the resulting loss function for general transportation costs and derive gradient formulas. Physical measures are approximated as fixed points of suitable PDE-based Perron–Frobenius operators. Test cases discussed in the paper include common low-dimensional dynamical systems.
1 August 2020 in Inverse Problems
The need to solve discrete ill-posed problems arises in many areas of science and engineering. Solutions of these problems, if they exist, are very sensitive to perturbations in the available data. Regularization replaces the original problem by a nearby regularized problem, whose solution is less sensitive to the error in the data. The regularized problem contains a fidelity term and a regularization term. Recently, the use of a p -norm to measure the fidelity term and a q -norm to measure the regularization term has received considerable attention. The balance between these terms is determined by a regularization parameter. In many applications, such as in image restoration, the desired solution is known to live in a convex set, such as the nonnegative orthant. It is natural to require the computed solution of the regularized problem to satisfy the same constraint(s). This paper shows that this procedure induces a regularization method and describes a modulus-based iterative method for computing a constrained approximate solution of a smoothed version of the regularized problem. Convergence of the iterative method is shown, and numerical examples that illustrate the performance of the proposed method are presented.
28 June 2023 in Inverse Problems
The variable projection (VarPro) method is an efficient method to solve separable nonlinear least squares problems. In this paper, we propose a modified VarPro method for solving separable nonlinear least squares problems with general-form Tikhonov regularization. In particular, we apply the Gauss–Newton method to the corresponding reduced problem and investigate its convergence when different approximations of the Jacobian matrix are used. For special cases when computing the generalized singular value decomposition is feasible or a joint spectral decomposition of both forward and regularization operators exists, we provide efficient ways to compute the Jacobians and the solution of the linear subproblems. For large-scale problems, where matrix decompositions are not an option, we compute a reduced Jacobian and apply projection-based iterative methods and generalized Krylov subspace methods to solve the linear subproblems. In all cases, the regularization parameter can be computed automatically at each iteration using generalized cross validation. Several numerical examples highlight the proposed approach’s performance in the quality of the reconstructed image and the reconstructed forward operator, including large-scale two-dimensional imaging problems arising from semi-blind deblurring.
1 January 2024 in Numerical Algebra, Control & Optimization
In this work, we investigate various approaches that use learning from training data to solve inverse problems, following a bi-level learning approach. We consider a general framework for optimal inversion design, where training data can be used to learn optimal regularization parameters, data fidelity terms, and regularizers, thereby resulting in superior variational regularization methods. In particular, we describe methods to learn optimal $ p $ and $ q $ norms for $ {\rm L}^p-{\rm L}^q $ regularization and methods to learn optimal parameters for regularization matrices defined by covariance kernels. We exploit efficient algorithms based on Krylov projection methods for solving the regularized problems, both at training and validation stages, making these methods well-suited for large-scale problems. Our experiments show that the learned regularization methods perform well even when there is some inexactness in the forward operator, resulting in a mixture of model and measurement error.
2 December 2025 in Journal of the American Statistical Association