AI & ML






Randomly shifted lattice rules for SDEs with constant diffusion: error bounds uniform in time discretization and dimension
arXiv cs.NA0 views
arXiv:2611.07424v1 Announce Type: new Abstract: We study randomly shifted rank-1 lattice rules for computing $\mathbb{E}[g(\mathbf{X}_T)]$, where $\mathbf{X}_T$ is the terminal state of a stochastic differential equation (SDE) with constant diffusion matrix. Discretizing the SDE by the Euler--Maruyama scheme with $m$ uniform time steps turns the expectation into an integral whose dimension grows with $m$ and whose integrand has a nested composition structure; both complicate the lattice rule error analysis. We generate the Brownian path by the Brownian bridge construction and handle the nested structure using the multivariate Fa\`a di Bruno formula and a rooted-tree expansion. Under suitable regularity and growth conditions, we prove that an $N$-point randomly shifted lattice rule with a uniformly random generating vector achieves a mean absolute sampling error of $O(N^{-1+\varepsilon})$ for every $\varepsilon\in(0,1/2)$ and every prime $N$, with the implied constant independent of $m$. To improve stability and control higher error moments, the median lattice estimator is used. The estimator takes the median of $R=2k-1$ independent lattice estimates and achieves an $L^q$ error of $O(N^{-1+\varepsilon})$ for every $1\le qSource:https://arxiv.org/abs/2611.07424
PreviousAsymptotic-Preserving Tensor Neural Networks for 3D High-Field Kinetic Equations with Applications to Uncertainty QuantificationNextHybrid Newton-BFGS high-index saddle dynamics for accelerating saddle-point searches
Related posts
How to Name an AI Safety Owner in Your Policy
0dev.to AI
AWS publishes a serverless MCP reference design for agent data access
0dev.to AWS
What a comparison page needs before it needs anything else
0dev.to WebDev

RAG from Zero to Hero: Building Naive, Advanced and Modular RAG from Scratch with Python
0dev.to Python
Give Claude Code a revenue recognition tool: from "add this contract" to an approved draft in 2 minutes
0dev.to Python
How I found 6 silent security gates in GnuTLS (and why CI green isn't always what it seems)
0dev.to DevOps
show = false, 2600)"
x-show="show" x-cloak x-transition.opacity.duration.200ms
class="fixed bottom-8 left-1/2 z-[80] -translate-x-1/2 rounded-lg border border-line bg-card px-4 py-2.5 text-sm text-heading shadow-card-hover"
role="status" aria-live="polite">