Fetching the paper…
Reading the bibliography…
Recently, neural networks have been widely applied for solving partial differential equations (PDEs).
“Variational crimes in the finite element method”
Gilbert Strang · 1972
Earlier work this paper cites.
“Remarques sur un résultat non publié de B. Maurey”
Gilles Pisier · 1981
Earlier work this paper cites.
“A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training”
Lee Jones · 1992
Earlier work this paper cites.
“Universal approximation bounds for superpositions of a sigmoidal function”
Andrew Barron · 1993
Earlier work this paper cites.
“Constructive approximation”
Ronald DeVore and George Lorentz · 1993
Earlier work this paper cites.
“Matching pursuits with time-frequency dictionaries”
Stéphane Mallat and Zhifeng Zhang · 1993
Earlier work this paper cites.
“Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition”
Yagyensh Pati, Ramin Rezaiifar and Perinkulam Krishnaprasad · 1993
Earlier work this paper cites.
“Neural-network-based approximations for solving partial differential equations”
MWMG Dissanayake and Nhan Phan-Thien · 1994
Earlier work this paper cites.
“Probability inequalities for sums of bounded random variables”
Wassily Hoeffding · 1994
Earlier work this paper cites.
“Some remarks on greedy algorithms”
Ronald DeVore and Vladimir Temlyakov · 1996
Earlier work this paper cites.
“Efficient agnostic learning of neural networks with bounded fan-in”
Wee Lee, Peter Bartlett and Robert Williamson · 1996
Earlier work this paper cites.
“Constructive approximation: advanced problems”
George Lorentz, Manfred Golitschek and Yuly Makovoz · 1996
Earlier work this paper cites.
“Ridgelets: theory and applications”
Emmanuel Candes · 1998
Earlier work this paper cites.
“Rademacher and Gaussian complexities: Risk bounds and structural results”
Peter Bartlett and Shahar Mendelson · 2002
Earlier work this paper cites.
“Sequential greedy approximation for certain convex optimization problems”
Tong Zhang · 2003
Earlier work this paper cites.
“A new family of solvers for some classes of multidimensional partial differential equations encountered in kinetic theory modeling of complex fluids”
Amine Ammar, Béchir Mokdad, Francisco Chinesta and Roland Keunings · 2006
Earlier work this paper cites.
“A finite difference method and analysis for 2D nonlinear Poisson–Boltzmann equations”
Zhilin Li, C.. Pao and Zhonghua Qiao · 2007
Earlier work this paper cites.
“Approximation and learning by greedy algorithms”
Andrew Barron, Albert Cohen, Wolfgang Dahmen and Ronald DeVore · 2008
Earlier work this paper cites.
“On the complexity of linear prediction: Risk bounds, margin bounds, and regularization”, 2008
Sham Kakade, Karthik Sridharan and Ambuj Tewari · 2008
Earlier work this paper cites.
“Greedy approximation”
Vladimir Temlyakov · 2008
Earlier work this paper cites.
“Results and questions on a nonlinear approximation approach for solving high-dimensional partial differential equations”
Claude Le, Tony Lelievre and Yvon Maday · 2009
Earlier work this paper cites.
“Greedy approximation”
Vladimir Temlyakov · 2011
Earlier work this paper cites.
“Greedy approximation of high-dimensional Ornstein–Uhlenbeck operators”
Leonardo Figueroa and Endre Süli · 2012
Earlier work this paper cites.
“Greedy algorithms for high-dimensional non-symmetric linear problems”
Eric Cances, Virginie Ehrlacher and Tony Lelievre · 2013
Earlier work this paper cites.
“Adam: A method for stochastic optimization”
Diederik Kingma and Jimmy Ba · 2014
Earlier work this paper cites.
“Understanding machine learning: From theory to algorithms”
Shai Shalev-Shwartz and Shai Ben-David · 2014
Earlier work this paper cites.
“Dropout rademacher complexity of deep neural networks”
Wei Gao and Zhi-Hua Zhou · 2016
Earlier work this paper cites.
“Breaking the curse of dimensionality with convex neural networks”
Francis Bach · 2017
Earlier work this paper cites.
“Solving the quantum many-body problem with artificial neural networks”
Giuseppe Carleo and Matthias Troyer · 2017
Earlier work this paper cites.
“Error bounds for approximations with deep ReLU networks”
Dmitry Yarotsky · 2017
Earlier work this paper cites.
“Gradient Descent Provably Optimizes Over-parameterized Neural Networks”
Simon Du, Xiyu Zhai, Barnabas Poczos and Aarti Singh · 2018
Earlier work this paper cites.
Philipp Grohs, Fabian Hornung, Arnulf Jentzen and Philippe Von · 2018
Earlier work this paper cites.
“Solving high-dimensional partial differential equations using deep learning”
Jiequn Han, Arnulf Jentzen and E Weinan · 2018
Cited alongside, same era.
“Approximation by Combinations of ReLU and Squared ReLU Ridge Functions With ℓ 1 \ell^{1} and ℓ 0 \ell^{0} Controls”
Jason Klusowski and Andrew Barron · 2018
Cited alongside, same era.
“Foundations of machine learning”
Mehryar Mohri, Afshin Rostamizadeh and Ameet Talwalkar · 2018
Cited alongside, same era.
“Do CIFAR-10 classifiers generalize to CIFAR-10?”
Benjamin Recht, Rebecca Roelofs, Ludwig Schmidt and Vaishaal Shankar · 2018
Cited alongside, same era.
“DGM: A deep learning algorithm for solving partial differential equations”
Justin Sirignano and Konstantinos Spiliopoulos · 2018
Cited alongside, same era.
“Gradient descent optimizes over-parameterized deep ReLU networks”
Difan Zou, Yuan Cao, Dongruo Zhou and Quanquan Gu · 2020
Later among the works it cites.
“Physics-informed neural networks for heat transfer problems”
Shengze Cai et al · 2021
Closest in time.
“Choose a transformer: Fourier or galerkin”
Shuhao Cao · 2021
Closest in time.
“On the representation of solutions to elliptic pdes in barron spaces”
Ziang Chen, Jianfeng Lu and Yulong Lu · 2021
Closest in time.
“Nonlinear Approximation and (Deep) ReLU Networks”
Ingrid Daubechies et al · 2021
Closest in time.
“Error analysis for physics informed neural networks (PINNs) approximating Kolmogorov PDEs”
Tim De and Siddhartha Mishra · 2021
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
E Weinan and Bing Yu · 2018
Cited alongside, same era.
“A convergence theory for deep learning via over-parameterization”
Zeyuan Allen-Zhu, Yuanzhi Li and Zhao Song · 2019
Cited alongside, same era.
“Fine-grained analysis of optimization and generalization for overparameterized two-layer neural networks”
Sanjeev Arora et al · 2019
Cited alongside, same era.
Qipin Chen and Wenrui Hao · 2019
Cited alongside, same era.
“Greedy Shallow Networks: A New Approach for Constructing and Training Neural Networks”
Anton Dereventsov, Armenak Petrosyan and Clayton Webster · 2019
Cited alongside, same era.
“Gradient descent finds global minima of deep neural networks”
Simon Du et al · 2019
Cited alongside, same era.
“Theory of the frequency principle for general deep neural networks”
Tao Luo, Zheng Ma, Zhi-Qin Xu and Yaoyu Zhang · 2019
Cited alongside, same era.
“Convergence rate analysis for deep ritz method”
Chenguang Duan et al · 2021
Closest in time.
“A Priori Analysis of Stable Neural Network Solutions to Numerical PDEs”
Qingguo Hong, Jonathan Siegel and Jinchao Xu · 2021
Closest in time.
“Solving parametric PDE problems with artificial neural networks”
Yuehaw Khoo, Jianfeng Lu and Lexing Ying · 2021
Closest in time.
“On universal approximation and error bounds for fourier neural operators”
Nikola Kovachki, Samuel Lanthaler and Siddhartha Mishra · 2021
Closest in time.
“Error estimates for deeponets: A deep learning framework in infinite dimensions”
Samuel Lanthaler, Siddhartha Mishra and George Karniadakis · 2021
Closest in time.
“Higher-order Quasi-Monte Carlo training of deep neural networks”
Marcello Longo, Siddhartha Mishra, T Rusch and Christoph Schwab · 2021
Closest in time.
“Deep network approximation for smooth functions”
Jianfeng Lu, Zuowei Shen, Haizhao Yang and Shijun Zhang · 2021
Closest in time.
“Learning nonlinear operators via DeepONet based on the universal approximation theorem of operators”
Lu Lu et al · 2021
Closest in time.
“A priori generalization analysis of the deep Ritz method for solving high dimensional elliptic partial differential equations”
Yulong Lu, Jianfeng Lu and Min Wang · 2021
Closest in time.
“Error Estimates for the Deep Ritz Method with Boundary Penalty”
Johannes Müller and Marius Zeinhofer · 2021
Closest in time.
“What Kinds of Functions do Deep Neural Networks Learn? Insights from Variational Spline Theory”
Rahul Parhi and Robert Nowak · 2021
Closest in time.
Nihar Sawant, Boris Kramer and Benjamin Peherstorfer · 2021
Closest in time.
“Characterization of the Variation Spaces Corresponding to Shallow Neural Networks”
Jonathan Siegel and Jinchao Xu · 2021
Closest in time.
Jonathan Siegel and Jinchao Xu · 2021
Closest in time.
“Improved Approximation Properties of Dictionaries and Applications to Neural Networks”
Jonathan. Siegel and Jinchao Xu · 2021
Closest in time.
“Active Neuron Least Squares: A Training Method for Multivariate Rectified Neural Networks”
Mark Ainsworth and Yeonjong Shin · 2022
Closest in time.
“Physics-informed neural networks (PINNs) for fluid mechanics: A review”
Shengze Cai et al · 2022
Closest in time.
Ziang Chen, Jianfeng Lu, Yulong Lu and Shengxuan Zhou · 2022
Closest in time.
“Error estimates for physics informed neural networks approximating the Navier-Stokes equations”
Tim De, Ameya Jagtap and Siddhartha Mishra · 2022
Closest in time.
“On the activation function dependence of the spectral bias of neural networks”
Qingguo Hong, Qinyang Tan, Jonathan Siegel and Jinchao Xu · 2022
Closest in time.
“The Barron space and the flow-induced function spaces for neural network models”
Chao Ma and Lei Wu · 2022
Closest in time.
“Estimates on the generalization error of physics-informed neural networks for approximating a class of inverse problems for PDEs”
Siddhartha Mishra and Roberto Molinaro · 2022
Closest in time.
“Optimal approximation rate of ReLU networks in terms of width and depth”
Zuowei Shen, Haizhao Yang and Shijun Zhang · 2022
Closest in time.
“Optimal convergence rates for the orthogonal greedy algorithm”
Jonathan Siegel and Jinchao Xu · 2022
Closest in time.
“Representation formulas and pointwise properties for Barron functions”
Stephan Wojtowytsch · 2022
Closest in time.