New Monte Carlo and DNN methods approximate elliptic PDEs with drift and killing

Researchers have developed new Monte Carlo and deep neural network methods to approximate solutions for a specific class of linear elliptic partial differential equations. These methods build upon the Walk-on-Spheres algorithm and incorporate sampled random times to establish uniform error bounds. The study also demonstrates how to design deep neural networks that approximate these solutions, with parameter counts growing polynomially with inverse accuracy and problem dimension, extending prior complexity analyses to equations with drift and killing. AI

RANK_REASON The cluster contains a single academic paper detailing new mathematical methods. [lever_c_demoted from research: ic=1 ai=1.0]

Read on arXiv cs.LG →

• arXiv:2209.01432
• Beznea
• CORE Recommender
• deep neural network
• Elliptic PDEs
• Hugging Face
• Monte Carlo estimators
• Walk-on-Spheres Monte Carlo

• paper
• other

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →