PDE solutions are numerically represented by basis functions. Classical
...
We analyze stochastic gradient descent (SGD) type algorithms on a
high-d...
We investigate the asymptotic relation between the inverse problems rely...
Neural networks are powerful tools for approximating high dimensional da...
Finding the optimal configuration of parameters in ResNet is a nonconvex...
Finding parameters in a deep neural network (NN) that fit training data ...
The classical Langevin Monte Carlo method looks for i.i.d. samples from ...
The Underdamped Langevin Monte Carlo (ULMC) is a popular Markov chain Mo...
Langevin Monte Carlo (LMC) is a popular Markov chain Monte Carlo samplin...
Sampling from a log-concave distribution function on ℝ^d (with
d≫ 1) is ...
Sampling from a log-concave distribution function is one core problem th...
Ensemble Kalman Inversion (EnKI), originally derived from Enseble Kalman...
Ensemble Kalman sampling (EKS) is a method to find i.i.d. samples from a...
Stochastic Gradient Descent (SGD) plays a central role in modern machine...
Ensemble Kalman inversion (EKI) is a method introduced in [14] to find
s...
Dynamical low-rank algorithm are a class of numerical methods that compu...