all AI news
Weak Convergence of Approximate reflection coupling and its Application to Non-convex Optimization. (arXiv:2205.11970v1 [math.PR])
May 25, 2022, 1:11 a.m. | Keisuke Suzuki
stat.ML updates on arXiv.org arxiv.org
In this paper, we propose a weak approximation of the reflection coupling
(RC) for stochastic differential equations (SDEs), and prove it converges
weakly to the desired coupling. In contrast to the RC, the proposed approximate
reflection coupling (ARC) need not take the hitting time of processes to the
diagonal set into consideration and can be defined as the solution of some SDEs
on the whole time interval. Therefore, ARC can work effectively against SDEs
with different drift terms. As an …
More from arxiv.org / stat.ML updates on arXiv.org
Jobs in AI, ML, Big Data
Data Architect
@ University of Texas at Austin | Austin, TX
Data ETL Engineer
@ University of Texas at Austin | Austin, TX
Lead GNSS Data Scientist
@ Lurra Systems | Melbourne
Senior Machine Learning Engineer (MLOps)
@ Promaton | Remote, Europe
Data Analyst (H/F)
@ Business & Decision | Montpellier, France
Machine Learning Researcher
@ VERSES | Brighton, England, United Kingdom - Remote