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

推荐订阅源

F
Fortinet All Blogs
罗磊的独立博客
IT之家
IT之家
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
月光博客
月光博客
博客园 - Franky
博客园 - 聂微东
博客园_首页
爱范儿
爱范儿
量子位
博客园 - 三生石上(FineUI控件)
G
Google Developers Blog
Martin Fowler
Martin Fowler
小众软件
小众软件
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
Y
Y Combinator Blog
Vercel News
Vercel News
腾讯CDC
Microsoft Azure Blog
Microsoft Azure Blog
Hugging Face - Blog
Hugging Face - Blog
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
The Cloudflare Blog
Engineering at Meta
Engineering at Meta

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
Milstein-type methods for strong approximation of systems...
Christopher Rauhögger · 2025-05-21 · via math.PR updates on arXiv.org

We study strong approximation of $d$-dimensional stochastic differential equations (SDEs) with a discontinuous drift coefficient driven by a $d$-dimensional Brownian motion $W$. More precisely, we essentially assume that the drift coefficient $μ$ is piecewise Lipschitz continuous with an exceptional set $Θ\subset \mathbb{R}^d$ that is an orientable $C^5$-hypersurface of positive reach, the diffusion coefficient $σ$ is assumed to be Lipschitz continuous and, in a neighborhood of $Θ$, both coefficients are bounded and $σ$ is non-degenerate. Furthermore, both $μ$ and $σ$ are assumed to be $C^{1}$ with intrinsic Lipschitz continuous derivative on $\mathbb{R}^{d}\setminus Θ$. We introduce, for the first time in literature, a Milstein-type method which can be used to approximate SDEs of this type for general $d \in \mathbb{N}$ and prove that this Milstein-type scheme achieves an $L_{p}$-error rate of order at least $3/4-$ in terms of the number of steps. This method depends, in addition to evaluations of $W$ on a fixed grid, also on iterated integrals w.r.t. components of $W$, which can in general not be represented as functionals of $W$ evaluated at finitely many time points. We additionally prove that our suggested Milstein-type method is only dependent on evaluations of $W$ on a finite, fixed grid if $σ$ is additionally commutative. To obtain our main result we prove that a quasi-Milstein scheme achieves an $L_{p}$-error rate of order at least $3/4-$ in our setting if $μ$ is additionally continuous, which is of interest in itself.