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

推荐订阅源

B
Blog RSS Feed
J
Java Code Geeks
H
Help Net Security
Google DeepMind News
Google DeepMind News
博客园 - 司徒正美
Microsoft Security Blog
Microsoft Security Blog
宝玉的分享
宝玉的分享
Stack Overflow Blog
Stack Overflow Blog
D
DataBreaches.Net
The GitHub Blog
The GitHub Blog
S
SegmentFault 最新的问题
U
Unit 42
博客园 - 三生石上(FineUI控件)
Last Week in AI
Last Week in AI
M
MIT News - Artificial intelligence
WordPress大学
WordPress大学
小众软件
小众软件
博客园 - 叶小钗
D
Docker
量子位
P
Proofpoint News Feed
博客园_首页
T
Tailwind CSS Blog
F
Fortinet All Blogs

math.ST updates on arXiv.org

What is Learnable in Valiant's Theory of the Learnable? Learning Perturbations to Extrapolate Your LLM Byzantine-Robust Distributed Sparse Learning Revisited The Sample Complexity of Multiple Change Point Identification under Bandit Feedback A proximal gradient algorithm for composite log-concave sampling Model-based Bootstrap of Controlled Markov Chains Approximation of Maximally Monotone Operators : A Graph Convergence Perspective Posterior Contraction Rates for Sparse Kolmogorov-Arnold Networks in Anisotropic Besov Spaces MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound A Spectral Framework for Closed-Form Relative Density Estimation Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability Higher-Order Equilibrium Tracking for EM-Compressible Online Estimation Scaling Limits of Long-Context Transformers A Note on Non-Negative $L_1$-Approximating Polynomials Susceptibilities and Patterning: A Primer on Linear Response in Bayesian Learning Linear Response Estimators for Singular Statistical Models Statistical inference with belief functions: A survey Robust stochastic first order methods in heavy-tailed noise via medoid mini-batch gradient sampling Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity Adaptive auditing of AI systems with anytime-valid guarantees Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions Risk-Controlled Post-Processing of Decision Policies Covariate Balancing and Riesz Regression Should Be Guided by the Neyman Orthogonal Score in Debiased Machine Learning A Unified Pair-GRPO Family: From Implicit to Explicit Preference Constraints for Stable and General RL Alignment Time-Inhomogeneous Preconditioned Langevin Dynamics A Fine-Grained Understanding of Uniform Convergence for Halfspaces CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency Ratio-based Loss Functions Optimal Confidence Band for Kernel Gradient Flow Estimator A renormalization-group inspired lattice-based framework for piecewise generalized linear models
BSΔEs and BSDEs with non-Lipschitz drivers: Comparison, c...
Patrick Cheridito, Mitja Stadje · 2010-02-01 · via math.ST updates on arXiv.org

We provide existence results and comparison principles for solutions of backward stochastic difference equations (BS$Δ$Es) and then prove convergence of these to solutions of backward stochastic differential equations (BSDEs) when the mesh size of the time-discretizaton goes to zero. The BS$Δ$Es and BSDEs are governed by drivers $f^N(t,ω,y,z)$ and $f(t,ω,y,z),$ respectively. The new feature of this paper is that they may be non-Lipschitz in z. For the convergence results it is assumed that the BS$Δ$Es are based on d-dimensional random walks $W^N$ approximating the d-dimensional Brownian motion W underlying the BSDE and that $f^N$ converges to f. Conditions are given under which for any bounded terminal condition $ξ$ for the BSDE, there exist bounded terminal conditions $ξ^N$ for the sequence of BS$Δ$Es converging to $ξ$, such that the corresponding solutions converge to the solution of the limiting BSDE. An important special case is when $f^N$ and f are convex in z. We show that in this situation, the solutions of the BS$Δ$Es converge to the solution of the BSDE for every uniformly bounded sequence $ξ^N$ converging to $ξ$. As a consequence, one obtains that the BSDE is robust in the sense that if $(W^N,ξ^N)$ is close to $(W,ξ)$ in distribution, then the solution of the Nth BS$Δ$E is close to the solution of the BSDE in distribution too.