Related papers: Discrete-type approximations for non-Markovian opt…
This paper presents the benefits of using randomized neural networks instead of standard basis functions or deep neural networks to approximate the solutions of optimal stopping problems. The key idea is to use neural networks, where the…
This paper is devoted to the study of acceleration methods for an inequality constrained convex optimization problem by using Lyapunov functions. We first approximate such a problem as an unconstrained optimization problem by employing the…
A new algorithm for the approximation and simulation of twofold iterated stochastic integrals together with the corresponding L\'{e}vy areas driven by a multidimensional Brownian motion is proposed. The algorithm is based on a truncated…
We study solutions of a class of one-dimensional continuous reflected backward stochastic Volterra integral equations driven by Brownian motion, where the reflection keeps the solution above a given stochastic process (lower obstacle). We…
We study the so-called two-time-scale stochastic approximation, a simulation-based approach for finding the roots of two coupled nonlinear operators. Our focus is to characterize its finite-time performance in a Markov setting, which often…
This paper is devoted to the study of an inertial accelerated primal-dual algorithm, which is based on a second-order differential system with time scaling, for solving a non-smooth convex optimization problem with linear equality…
We consider the problem of approximating optimal in the Minimum Mean Squared Error (MMSE) sense nonlinear filters in a discrete time setting, exploiting properties of stochastically convergent state process approximations. More…
Two-time-scale stochastic approximation algorithms are iterative methods used in applications such as optimization, reinforcement learning, and control. Finite-time analysis of these algorithms has primarily focused on fixed point…
We consider anticipative Stratonovich stochastic differential equations driven by some stochastic process (not necessarily a semi-martingale). No adaptedness of initial point or vector fields is assumed. Under a simple condition on the…
We present an exact solution for one-dimensional overdamped dynamics near a hard wall, allowing us to connect steady-state distributions under confinement with the extreme value statistics of unconfined stochastic processes. This mapping…
We survey recent developments in the field of complexity of pathwise approximation in $p$-th mean of the solution of a stochastic differential equation at the final time based on finitely many evaluations of the driving Brownian motion.…
Given two probability measures $\mu, \nu$ on $\mathbb{R}^d$, in subharmonic order, we describe optimal stopping times $\tau$ that maximize/minimize the cost functional $\mathbb{E} |B_0 - B_\tau|^{\alpha}$, $\alpha > 0$, where $(B_t)_t$ is…
We discuss a class of stochastic second-order PDEs in one space-dimension with an inner boundary moving according to a possibly non-linear, Stefan-type condition. We show that proper separation of phases is attained, i.e., the solution…
We introduce a new framework for analyzing (Quasi-}Newton type methods applied to non-smooth optimization problems. The source of randomness comes from the evaluation of the (approximation) of the Hessian. We derive, using a variant of…
We present a methodology for obtaining explicit solutions to infinite time horizon optimal stopping problems involving general, one-dimensional, It\^o diffusions, payoff functions that need not be smooth and state-dependent discounting.…
The linear fractional stable motion generalizes two prominent classes of stochastic processes, namely stable L\'evy processes, and fractional Brownian motion. For this reason it may be regarded as a basic building block for continuous time…
We provide an error analysis for the solution of the nonstationary Stokes problem by a variational method in space and time. We use finite elements of higher order for the approximation in space and a Galerkin-Petrov method with first order…
In recent years, interest in approximation methods for stochastic differential equations (SDEs) with non-Lipschitz continuous coefficients has increased. We show lower bounds for the $L^p$-error of such methods in the case of approximation…
In this paper we consider a method of solving optimal stopping problems in discrete and continuous time based on their dual representation. A novel and generic simulation-based optimization algorithm not involving nested simulations is…
Given an initial (resp., terminal) probability measure $\mu$ (resp., $\nu$) on $\mathbb{R}^d$, we characterize those optimal stopping times $\tau$ that maximize or minimize the functional $\mathbb{E} |B_0 - B_\tau|^{\alpha}$, $\alpha > 0$,…