English
Related papers

Related papers: Some results on the Gittins index for a normal rew…

200 papers

We study optimal stopping of Feller-Markov processes to maximise an undiscounted functional consisting of running and terminal rewards. In a finite-time horizon setting, we extend classical results to unbounded rewards. In infinite horizon,…

Optimization and Control · Mathematics 2016-07-21 Jan Palczewski , Lukasz Stettner

I analyse the frequentist regret of the famous Gittins index strategy for multi-armed bandits with Gaussian noise and a finite horizon. Remarkably it turns out that this approach leads to finite-time regret guarantees comparable to those…

Machine Learning · Computer Science 2016-05-31 Tor Lattimore

We study the properties of the free boundaries and the corresponding hitting times in the context of optimal stopping in discrete time. We first prove the continuity of the map from the boundaries to the expected value of the corresponding…

Probability · Mathematics 2025-04-16 H. Mete Soner , Valentin Tissot-Daguette

We develop an approach for solving one-sided optimal stopping problems in discrete time for general underlying Markov processes on the real line. The main idea is to transform the problem into an auxiliary problem for the ladder height…

Probability · Mathematics 2018-10-29 Sören Christensen , Albrecht Irle

We study a sequential estimation problem for an unknown reward in the presence of a random horizon. The reward takes one of two predetermined values which can be inferred from the drift of a Wiener process, which serves as a signal. The…

Probability · Mathematics 2025-03-11 Steven Campbell , Georgy Gaitsgori , Richard Groenewald , Ioannis Karatzas

We consider the optimal stopping problem for a Gauss-Markov process conditioned to adopt a prescribed terminal distribution. By applying a time-space transformation, we show it is equivalent to stopping a Brownian bridge pinned at a random…

Probability · Mathematics 2025-05-26 Abel Azze , Bernardo D'Auria

This paper is concerned with the development of rigorous approximations to various expectations associated with Markov chains and processes having non-stationary transition probabilities. Such non-stationary models arise naturally in…

Probability · Mathematics 2018-05-07 Zeyu Zheng , Harsha Honnappa , Peter W. Glynn

We study the problem of finding the index of the minimum value of a vector from noisy observations. This problem is relevant in population/policy comparison, discrete maximum likelihood, and model selection. We develop an asymptotically…

Statistics Theory · Mathematics 2026-01-21 Tianyu Zhang , Hao Lee , Jing Lei

We obtain bounds to quantify the distributional approximation in the delta method for vector statistics (the sample mean of $n$ independent random vectors) for normal and non-normal limits, measured using smooth test functions. For normal…

Statistics Theory · Mathematics 2023-05-11 Robert E. Gaunt , Heather Sutcliffe

In this paper, we obtain an upper bound for the Gini mean difference based on mean, variance and correlation for the case when the variables are correlated. We also derive some closed-form expressions for the Gini mean difference when the…

Statistics Theory · Mathematics 2023-01-20 Roberto Vila , Narayanaswamy Balakrishnan , Helton Saulo

We consider optimal stopping problems, in which a sequence of independent random variables is drawn from a known continuous density. The objective of such problems is to find a procedure which maximizes the expected reward; this is often…

Probability · Mathematics 2020-12-07 Hugh Entwistle , Christopher Lustri , Georgy Sofronov

We develop a new formulation of Stein's method to obtain computable upper bounds on the total variation distance between the geometric distribution and a distribution of interest. Our framework reduces the problem to the construction of a…

Probability · Mathematics 2013-03-21 Erol A. Peköz , Adrian Röllin , Nathan Ross

The problem of approximating/tracking the value of a Wiener process is considered. The discretization points are placed at times when the value of the process differs from the approximation by some amount, here denoted by eta. It is found…

Probability · Mathematics 2010-02-03 Mats Brodén , Magnus Wiktorsson

This paper addresses the statistical problem of estimating the infinite-norm deviation from the empirical mean to the distribution mean for high-dimensional distributions on $\{0,1\}^d$, potentially with $d=\infty$. Unlike traditional…

Statistics Theory · Mathematics 2024-02-21 Moïse Blanchard , Václav Voráček

We propose an optimal sequential methodology for obtaining confidence intervals for a binomial proportion $\theta$. Assuming that an i.i.d. random sequence of Benoulli($\theta$) trials is observed sequentially, we are interested in…

Methodology · Statistics 2017-11-21 Tony Yaacoub , George V. Moustakides , Yajun Mei

In this paper, we investigate the asymptotic stability of finite-dimensional stochastic integrable Hamiltonian systems via information entropy. Specifically, we establish the asymptotic vanishing of Shannon entropy difference (with…

Dynamical Systems · Mathematics 2025-10-28 Chen Wang , Yong Li

New bounds for the $k$-th order derivatives of the solutions of the normal and multivariate normal Stein equations are obtained. Our general order bounds involve fewer derivatives of the test function than those in the existing literature.…

Probability · Mathematics 2017-03-21 Robert E. Gaunt

We consider a class of time-inhomogeneous optimal stopping problems and we provide sufficient conditions on the data of the problem that guarantee monotonicity of the optimal stopping boundary. In our setting, time-inhomogeneity stems not…

Optimization and Control · Mathematics 2023-01-16 Alessandro Milazzo

Gittins indices provide an optimal solution to the classical multi-armed bandit problem. An obstacle to their use has been the common perception that their computation is very difficult. This paper demonstrates an accessible general…

Machine Learning · Statistics 2019-09-12 James Edwards

We study the optimal stopping time problem $v(S)={\rm ess}\sup_{\theta \geq S} E[\phi(\theta)|\mathcal {F}_S]$, for any stopping time $S$, where the reward is given by a family $(\phi(\theta),\theta\in\mathcal{T}_0)$ \emph{of non negative…

Probability · Mathematics 2013-03-01 Magdalena Kobylanski , Marie-Claire Quenez