Rectified deep neural networks overcome the curse of dimensionality for nonsmooth value functions in zero-sum games of nonlinear stiff systems

From MaRDI portal
Publication:5132232

DOI10.1142/S0219530520500116zbMath1456.82804arXiv1903.06652OpenAlexW3031715235MaRDI QIDQ5132232

Yu-Fei Zhang, Christoph Reisinger

Publication date: 10 November 2020

Published in: Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.06652




Related Items (20)

Analysis of the Generalization Error: Empirical Risk Minimization over Deep Artificial Neural Networks Overcomes the Curse of Dimensionality in the Numerical Approximation of Black--Scholes Partial Differential EquationsA Proof that Artificial Neural Networks Overcome the Curse of Dimensionality in the Numerical Approximation of Black–Scholes Partial Differential EquationsSympOCnet: Solving Optimal Control Problems with Applications to High-Dimensional Multiagent Path Planning ProblemsDeep neural network approximations for solutions of PDEs based on Monte Carlo algorithmsOvercoming the curse of dimensionality in the numerical approximation of parabolic partial differential equations with gradient-dependent nonlinearitiesFull error analysis for the training of deep neural networksUnbiased Deep Solvers for Linear Parametric PDEsDeep learning methods for partial differential equations and related parameter identification problemsNumerical methods for backward stochastic differential equations: a surveyDeep xVA Solver: A Neural Network–Based Counterparty Credit Risk Management FrameworkNeural network approximation and estimation of classifiers with classification boundary in a Barron classSolving Kolmogorov PDEs without the curse of dimensionality via deep learning and asymptotic expansion with Malliavin calculusAn overview on deep learning-based approximation methods for partial differential equationsDeep ReLU network expression rates for option prices in high-dimensional, exponential Lévy modelsComputing Lyapunov functions using deep neural networksTensor Decomposition Methods for High-dimensional Hamilton--Jacobi--Bellman EquationsAlgorithms for solving high dimensional PDEs: from nonlinear Monte Carlo to machine learningApproximate value adjustments for European claimsDNN expression rate analysis of high-dimensional PDEs: application to option pricingA theoretical analysis of deep neural networks and parametric PDEs



Cites Work


This page was built for publication: Rectified deep neural networks overcome the curse of dimensionality for nonsmooth value functions in zero-sum games of nonlinear stiff systems