Randomized optimal stopping algorithms and their convergence analysis

02/03/2020
by   Christian Bayer, et al.
0

In this paper we study randomized optimal stopping problems and consider corresponding forward and backward Monte Carlo based optimisation algorithms. In particular we prove the convergence of the proposed algorithms and derive the corresponding convergence rates.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/07/2018

Optimal stopping via deeply boosted backward regression

In this note we propose a new approach towards solving numerically optim...
research
02/13/2013

Optimal Monte Carlo Estimation of Belief Network Inference

We present two Monte Carlo sampling algorithms for probabilistic inferen...
research
09/30/2019

Smoothed residual stopping for statistical inverse problems via truncated SVD estimation

This work examines under what circumstances adaptivity for truncated SVD...
research
06/22/2019

Semi-tractability of optimal stopping problems via a weighted stochastic mesh algorithm

In this article we propose a Weighted Stochastic Mesh (WSM) Algorithm fo...
research
12/01/2020

mlOSP: Towards a Unified Implementation of Regression Monte Carlo Algorithms

We introduce mlOSP, a computational template for Machine Learning for Op...
research
04/28/2021

Optimal Stopping via Randomized Neural Networks

This paper presents new machine learning approaches to approximate the s...
research
06/06/2022

Adjoint-based Adaptive Multi-Level Monte Carlo for Differential Equations

We present a multi-level Monte Carlo (MLMC) algorithm with adaptively re...

Please sign up or login with your details

Forgot password? Click here to reset