惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

WordPress大学
WordPress大学
G
Google Developers Blog
M
MIT News - Artificial intelligence
Vercel News
Vercel News
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
GbyAI
GbyAI
B
Blog RSS Feed
Blog — PlanetScale
Blog — PlanetScale
Microsoft Security Blog
Microsoft Security Blog
V
Visual Studio Blog
Stack Overflow Blog
Stack Overflow Blog
雷峰网
雷峰网
The Cloudflare Blog
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
F
Fortinet All Blogs
L
LangChain Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
A
About on SuperTechFans
T
The Blog of Author Tim Ferriss
B
Blog
J
Java Code Geeks
Hugging Face - Blog
Hugging Face - Blog
I
InfoQ
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com

math.PR updates on arXiv.org

Visibility in the Boolean Model on Harmonic Manifolds Global estimates on the Brenier map Geodesics and Wandering Exponents in Brochette First-Passage Percolation State-dependent inverse-subordinator time changes of regenerative processes: Excursion structure and multiscale occupation-time limits Randomly twisted transfer operators and singular values statistics Generalized Bessel-Dunkl diffusions An almost sure invariance principle for the Takagi-van der Waerden class functions Central limit theorems for high dimensional lattice polytopes: cosmological polytopes Convergence rate estimates for semigroups and heat kernels associated with resistance forms Second-order Poincaré inequalities and localization on the Poisson space Maximum Probability of Independence in Transitive Matroids On global solutions to the semidiscrete stochastic heat equation The Poisson Tail Conjecture for primes in short intervals A Complete Spectral Analysis of the CEV Operator with Applications to Arbitrage Holographic functions and neural networks From Betting to Empirical Bernstein LIL Concentration of General Stochastic Approximation Under Heavy-Tailed Markovian Noise Pointwise Generalization in Deep Neural Networks Bayesian Latent Space Models for Graphs Are Misspecified: Toward Robust Inference via Generalized Posteriors Wasserstein bounds for denoising diffusion probabilistic models via the Föllmer process A note on connections between the Föllmer process and the denoising diffusion probabilistic model Simple Approximation and Derivative Free Inference-Time Scaling for Diffusion Models via Sequential Monte Carlo on Path Measures Diffusion-Based Stochastic Operator Networks for Uncertainty Quantification in Stochastic Partial Differential Equations A Fourier perspective on the learning dynamics of neural networks: from sample complexities to mechanistic insights Propagation of Chaos in Contextual Flow Maps Dimension-Uniform Discretization Analysis of Preconditioned Annealed Langevin Dynamics for Multimodal Gaussian Mixtures $α$-TCAV: A Unified Framework for Testing with Concept Activation Vectors Scaling Laws from Sequential Feature Recovery: A Solvable Hierarchical Model On the Limits of Latent Reuse in Diffusion Models State-of-art minibatches via novel DPP kernels: discretization, wavelets, and rough objectives
Robust Optimization of PDEs with Random Coefficients Usin...
Andreas Van Barel, Stefan Vandewalle · 2017-11-07 · via math.PR updates on arXiv.org

This paper addresses optimization problems constrained by partial differential equations with uncertain coefficients. In particular, the robust control problem and the average control problem are considered for a tracking type cost functional with an additional penalty on the variance of the state. The expressions for the gradient and Hessian corresponding to either problem contain expected value operators. Due to the large number of uncertainties considered in our model, we suggest to evaluate these expectations using a multilevel Monte Carlo (MLMC) method. Under mild assumptions, it is shown that this results in the gradient and Hessian corresponding to the MLMC estimator of the original cost functional. Furthermore, we show that the use of certain correlated samples yields a reduction in the total number of samples required. Two optimization methods are investigated: the nonlinear conjugate gradient method and the Newton method. For both, a specific algorithm is provided that dynamically decides which and how many samples should be taken in each iteration. The cost of the optimization up to some specified tolerance $τ$ is shown to be proportional to the cost of a gradient evaluation with requested root mean square error $τ$. The algorithms are tested on a model elliptic diffusion problem with lognormal diffusion coefficient. An additional nonlinear term is also considered.