output
20162026
most citedAlbumentations: fast and flexible image augmentations

2.3k citations

Showing math.NAShow all

17 papers · 1 filter

math.NA2025★ 1 cited

Adaptive feature capture method for solving partial differential equations with near singular solutions

Yangtao Deng, Qiaolin He, Xiaoping Wang

Partial differential equations (PDEs) with near singular solutions pose significant challenges for traditional numerical methods, particularly in complex geometries where mesh gene…

math.NA2024★ 1 cited

A Relaxed Lagrange Multiplier Approach for Phase Field Models

Jinpeng Zhang, Chaoyu Quan, Xiaoping Wang

This paper introduces a novel relaxed Lagrange multiplier (RLM) method for designing efficient and energy-stable numerical schemes for phase-field models. The proposed approach ref…

math.NA2022★ 1 cited

An efficient Monte Carlo scheme for Zakai equations

Christian Beck, Sebastian Becker, Patrick Cheridito +2

In this paper we develop a numerical method for efficiently approximating solutions of certain Zakai equations in high dimensions. The key idea is to transform a given Zakai SPDE i…

math.NA2022★ 4 cited

Fast operator splitting methods for obstacle problems

Hao Liu, Dong Wang

The obstacle problem is a class of free boundary problems which finds applications in many disciplines such as porous media, financial mathematics and optimal control. In this pape…

math.NA2022★ 11 cited

Learning the random variables in Monte Carlo simulations with stochastic gradient descent: Machine learning for parametric PDEs and financial derivative pricing

Sebastian Becker, Arnulf Jentzen, Marvin S. Müller +1

In financial engineering, prices of financial products are computed approximately many times each trading day with (slightly) different parameters in each calculation. In many fina…

math.NA2021★ 13 cited

A proof of convergence for stochastic gradient descent in the training of artificial neural networks with ReLU activation for constant target functions

Arnulf Jentzen, Adrian Riekert

In this article we study the stochastic gradient descent (SGD) optimization method in the training of fully-connected feedforward artificial neural networks with ReLU activation. T…

math.NA2021★ 26 cited

A proof of convergence for gradient descent in the training of artificial neural networks for constant target functions

Patrick Cheridito, Arnulf Jentzen, Adrian Riekert +1

Gradient descent optimization algorithms are the standard ingredients that are used to train artificial neural networks (ANNs). Even though a huge number of numerical simulations i…

math.NA2020★ 88 cited

An overview on deep learning-based approximation methods for partial differential equations

Christian Beck, Martin Hutzenthaler, Arnulf Jentzen +1

It is one of the most challenging problems in applied mathematics to approximatively solve high-dimensional partial differential equations (PDEs). Recently, several deep learning-b…

math.NA2020★ 162 cited

Algorithms for Solving High Dimensional PDEs: From Nonlinear Monte Carlo to Machine Learning

Weinan E, Jiequn Han, Arnulf Jentzen

In recent years, tremendous progress has been made on numerical algorithms for solving partial differential equations (PDEs) in a very high dimension, using ideas from either nonli…

math.NA2020★ 22 cited

Neural Parametric Fokker-Planck Equations

Shu Liu, Wuchen Li, Hongyuan Zha +1

In this paper, we develop and analyze numerical methods for high dimensional Fokker-Planck equations by leveraging generative models from deep learning. Our starting point is a for…

math.NA2019★ 8 cited

Jacobi-type algorithm for low rank orthogonal approximation of symmetric tensors and its convergence analysis

Jianze Li, Konstantin Usevich, Pierre Comon

In this paper, we propose a Jacobi-type algorithm to solve the low rank orthogonal approximation problem of symmetric tensors. This algorithm includes as a special case the well-kn…

math.NA2019★ 44 cited

Full error analysis for the training of deep neural networks

Christan Beck, Arnulf Jentzen, Benno Kuckuck

Deep learning algorithms have been applied very successfully in recent years to a range of problems out of reach for classical solution paradigms. Nevertheless, there is no complet…

math.NA2019★ 16 cited

Deep neural network approximations for Monte Carlo algorithms

Philipp Grohs, Arnulf Jentzen, Diyora Salimova

Recently, it has been proposed in the literature to employ deep neural networks (DNNs) together with stochastic gradient descent methods to approximate solutions of PDEs. There are…

math.NA2018★ 48 cited

A proof that deep artificial neural networks overcome the curse of dimensionality in the numerical approximation of Kolmogorov partial differential equations with constant diffusion and nonlinear drift coefficients

Arnulf Jentzen, Diyora Salimova, Timo Welti

In recent years deep artificial neural networks (DNNs) have been successfully employed in numerical simulations for a multitude of computational problems including, for example, ob…

math.NA2018★ 153 cited

A proof that artificial neural networks overcome the curse of dimensionality in the numerical approximation of Black-Scholes partial differential equations

Philipp Grohs, Fabian Hornung, Arnulf Jentzen +1

Artificial neural networks (ANNs) have very successfully been used in numerical simulations for a series of computational problems ranging from image classification/image recogniti…

math.NA2017★ 5 cited

Approximate Newton Methods

Haishan Ye, Luo Luo, Zhihua Zhang

Many machine learning models involve solving optimization problems. Thus, it is important to deal with a large-scale optimization problem in big data applications. Recently, subsam…

math.NA2016★ 69 cited

Multilevel Picard iterations for solving smooth semilinear parabolic heat equations

Weinan E, Martin Hutzenthaler, Arnulf Jentzen +1

We introduce a new family of numerical algorithms for approximating solutions of general high-dimensional semilinear parabolic partial differential equations at single space-time p…