Related papers: Convergence of values in optimal stopping
We review recent quantitative results on the approximation of mean field diffusion equations by large systems of interacting particles, obtained by optimal coupling methods. These results concern a larger range of models, more precise…
We provide a theoretical treatment of over-specified Gaussian mixtures of experts with covariate-free gating networks. We establish the convergence rates of the maximum likelihood estimation (MLE) for these models. Our proof technique is…
New results on uniform convergence in probability for the most general classes of wavelet expansions of stationary Gaussian random processes are given.
We propose a general framework to study last passage times, suprema and drawdowns of a large class of stochastic processes. A central role in our approach is played by processes of class Sigma. After investigating convergence properties and…
A convergence theorem for martingales with c\`adl\`ag trajectories (right continuous with left limits everywhere) is obtained in the sense of the weak dual topology on Hilbert space, under conditions that are much weaker than those required…
We establish the upper bound on the speed of convergence to the infinitely divisible limit density in the local limit theorem for triangular arrays of random variables $\{X_{k,n},\, k=1,..,a_n, \, n\in \nat\}$.
This paper presents new variants of the averaged alternating modified reflections (AAMR) method for the best approximation problem. Under a mild constraint qualification, we first show its weak convergence and then establish a convergence…
Indices of acceptability are well suited to frame the axiomatic features of many performance measures, associated to terminal random cash flows.We extend this notion to classes of c\`adl\`ag processes modelling cash flows over a fixed…
Let $X$, $X_1$, $X_2$, $...$ be i.i.d. random variables, and let $S_n=X_1+... + X_n$ be the partial sums and $M_n=\max_{k\le n}|S_k|$ be the maximum partial sums. We give the sufficient and necessary conditions for a kind of limit theorems…
We study the (weak) equilibrium problem arising from the problem of optimally stopping a one-dimensional diffusion subject to an expectation constraint on the time until stopping. The weak equilibrium problem is realized with a set of…
Starting from an iterative and hence numerically easily implementable representation of the thin set of jumps of a c\`{a}dl\`{a}g adapted stochastic process $X$ (including a few applications to the integration with respect to the jump…
We consider the optimal stopping of a class of spectrally negative jump diffusions. We state a set of conditions under which the value is shown to have a representation in terms of an ordinary nonlinear programming problem. We establish a…
We consider the problem of global optimization of a function over a continuous domain. In our setup, we can evaluate the function sequentially at points of our choice and the evaluations are noisy. We frame it as a continuum-armed bandit…
Consider finite sequences $X_{[1,n]}=X_1\dots X_n$ and $Y_{[1,n]}=Y_1\dots Y_n$ of length $n$, consisting of i.i.d.\ samples of random letters from a finite alphabet, and let $S$ and $T$ be chosen i.i.d.\ randomly from the unit ball in the…
We derive novel anti-concentration bounds for the difference between the maximal values of two Gaussian random vectors across various settings. Our bounds are dimension-free, scaling with the dimension of the Gaussian vectors only through…
For a class of stationary regularly varying and weakly dependent time series, we prove the so-called complete convergence result for the corresponding space-time point processes. As an application of our main theorem, we give a simple proof…
The maximality principle has been a valuable tool in identifying the free-boundary functions that are associated with the solutions to several optimal stopping problems involving one-dimensional time-homogeneous diffusions and their running…
We present two Monte Carlo sampling algorithms for probabilistic inference that guarantee polynomial-time convergence for a larger class of network than current sampling algorithms provide. These new methods are variants of the known…
We consider the set of finite sequences of length n over a finite or countable alphabet C. We consider the function which associate each given sequence with the size of the maximum overlap with a (shifted) copy of itself. We compute the…
The contour of a family of filters along a filter is a set-theoretic lower limit. Topologicity and regularity of convergences can be characterized with the aid of the contour operation. Contour inversion is studied, in particular, for…