Related papers: Regularity estimate and sparse approximation of pa…
The Kalman filter and Rauch-Tung-Striebel (RTS) smoother are optimal for state estimation in linear dynamic systems. With nonlinear systems, the challenge consists in how to propagate uncertainty through the state transitions and output…
This paper presents a probabilistic framework to obtain both reliable and fast uncertainty estimates for predictions with Deep Neural Networks (DNNs). Our main contribution is a practical and principled combination of DNNs with sparse…
Upon its inception the theory of regularity structures allowed for the treatment for many semilinear perturbations of the stochastic heat equation driven by space-time white noise. When the driving noise is non-Gaussian the machinery of…
Estimating covariance matrices with high-dimensional complex data presents significant challenges, particularly concerning positive definiteness, sparsity, and numerical stability. Existing robust sparse estimators often fail to guarantee…
We study the Darcy boundary value problem with log-normal permeability field. We adopt a perturbation approach, expanding the solution in Taylor series around the nominal value of the coefficient, and approximating the expected value of the…
We develop new solvability methods for divergence form second order, real and complex, elliptic systems above Lipschitz graphs, with $L_2$ boundary data. The coefficients $A$ may depend on all variables, but are assumed to be close to…
The paper considers a class of linear Boltzmann transport equations which models a charged particle transport. The equation is an approximation of the original exact transport equation which involves hyper-singular integrals in their…
Consider an It\^{o} process $X$ satisfying the stochastic differential equation $dX=a(X)\,dt+b(X)\,dW$ where $a,b$ are smooth and $W$ is a multidimensional Brownian motion. Suppose that $W_n$ has smooth sample paths and that $W_n$ converges…
The Gromov-Wasserstein (GW) distance quantifies discrepancy between metric measure spaces and provides a natural framework for aligning heterogeneous datasets. Alas, as exact computation of GW alignment is NP hard, entropic regularization…
We construct an efficient approach to deal with the global regularity estimates for a class of elliptic double-obstacle problems in Lorentz and Orlicz spaces. The motivation of this paper comes from the study on an abstract result in the…
In this paper, we consider a semi-linear stochastic strongly damped wave equation driven by additive Gaussian noise. Following a semigroup framework, we establish existence, uniqueness and space-time regularity of a mild solution to such…
We study the transport property of Gaussian measures on Sobolev spaces of periodic functions under the dynamics of the one-dimensional cubic fractional nonlinear Schr\"{o}dinger equation. For the case of second-order dispersion or greater,…
In this paper we analyze the finite element approximation of the Stokes equations with non-smooth Dirichlet boundary data. To define the discrete solution, we first approximate the boundary datum by a smooth one and then apply a standard…
The Wong-Zakai theorem asserts that ODEs driven by "reasonable" (e.g. piecewise linear) approximations of Brownian motion converge to the corresponding Stratonovich stochastic differential equation. With the aid of rough path analysis, we…
Common efficient schemes for the incompressible Navier-Stokes equations, such as projection or fractional step methods, have limited temporal accuracy as a result of matrix splitting errors, or introduce errors near the domain boundaries…
This paper concerns quasi-stochastic approximation (QSA) to solve root finding problems commonly found in applications to optimization and reinforcement learning. The general constant gain algorithm may be expressed as the…
We consider two most studied standard models in the theory of elasto-plasticity with hardening in arbitrary dimension $d\ge 2$, namely, the kinematic hardening and the isotropic hardening problem. While the existence and uniqueness of the…
Sparsity is a highly desired feature in deep neural networks (DNNs) since it ensures numerical efficiency, improves the interpretability of models (due to the smaller number of relevant features), and robustness. For linear models, it is…
We consider the inverse problem of recovering stationary coefficients in a class of dynamical Schr\"odinger equations with locally analytic nonlinear terms. Upon treating the well-posedness for small initial data and trivial boundary data,…
We consider the problem of estimating a time-varying sparse precision matrix, which is assumed to evolve in a piece-wise constant manner. Building upon the Group Fused LASSO and LASSO penalty functions, we estimate both the network…