English
Related papers

Related papers: Optimal Online Selection of a Monotone Subsequence…

200 papers

We perform a rigorous runtime analysis for the Univariate Marginal Distribution Algorithm on the LeadingOnes function, a well-known benchmark function in the theory community of evolutionary computation with a high correlation between…

Neural and Evolutionary Computing · Computer Science 2019-04-22 Per Kristian Lehre , Phan Trung Hai Nguyen

We define the local empirical process, based on $n$ i.i.d. random vectors in dimension $d$, in the neighborhood of the boundary of a fixed set. Under natural conditions on the shrinking neighborhood, we show that, for these local empirical…

Statistics Theory · Mathematics 2011-04-22 John H. J. Einmahl , Estáte V. Khmaladze

Consider a collection of competing machine learning algorithms. Given their performance on a benchmark of datasets, we would like to identify the best performing algorithm. Specifically, which algorithm is most likely to rank highest on a…

Machine Learning · Computer Science 2025-08-08 Amichai Painsky

A set of intervals is independent when the intervals are pairwise disjoint. In the interval selection problem we are given a set $\mathbb{I}$ of intervals and we want to find an independent subset of intervals of largest cardinality. Let…

Data Structures and Algorithms · Computer Science 2015-02-05 Sergio Cabello , Pablo Pérez-Lantero

Fix some $n \in \mathbb{N}$ and let $X_1, X_2,\dots, X_n$ be independent random variables drawn from the uniform distribution on $[0,1]$. A decision maker is shown the variables sequentially and, after each observation, must decide whether…

Probability · Mathematics 2016-02-01 Rémi Dendievel , Yvik Swan

Peng (2006) initiated a new kind of central limit theorem under sub-linear expectations. Song (2017) gave an estimate of the rate of convergence of Peng's central limit theorem. Based on these results, we establish a new kind of almost sure…

Probability · Mathematics 2018-10-19 Weihuan Huang , Panyu Wu

We examine the behavior of the number of $k$-term arithmetic progressions in a random subset of $\mathbb{Z}/n\mathbb{Z}$. We prove that if a set is chosen by including each element of $\mathbb{Z}/n\mathbb{Z}$ independently with constant…

Combinatorics · Mathematics 2020-04-07 Ross Berkowitz , Ashwin Sah , Mehtaab Sawhney

We consider the following sample selection problem. We observe in an online fashion a sequence of samples, each endowed by a quality. Our goal is to either select or reject each sample, so as to maximize the aggregate quality of the…

Data Structures and Algorithms · Computer Science 2010-07-20 Eric Bach , Shuchi Chawla , Seeun Umboh

This paper extends classical probabilistic results to the broader class of demimartingales and demisubmartingales. We establish variants of Doob's-type optional sampling theorem under minimal structural conditions on stopping times, relying…

Probability · Mathematics 2025-07-24 Milto Hadjikyriakou , B. L. S Prakasa Rao

Let $X_1,\dots,X_n$ be independent nonnegative random variables (r.v.'s), with $S_n:=X_1+\dots+X_n$ and finite values of $s_i:=E X_i^2$ and $m_i:=E X_i>0$. Exact upper bounds on $E f(S_n)$ for all functions $f$ in a certain class…

Probability · Mathematics 2017-01-17 Iosif Pinelis

Real numbers from the interval [0, 1] are randomly selected with uniform distribution. There are $n$ of them and they are revealed one by one. However, we do not know their values but only their relative ranks. We want to stop on recently…

Combinatorics · Mathematics 2019-04-30 Ewa M. Kubicka , Grzegorz Kubicki , Małgorzata Kuchta , Małgorzata Sulkowska

It is well understood that if one is given a set $X \subset [0,1]$ of $n$ independent uniformly distributed random variables, then $$ \sup_{0 \leq x \leq 1} \left| \frac{\# X \cap [0,x]}{\# X} - x \right| \lesssim \frac{\sqrt{\log{n}}}{…

Probability · Mathematics 2025-01-24 Dmitriy Bilyk , Stefan Steinerberger

In our problem, we are given access to a number of sequences of nonnegative i.i.d. random variables, whose realizations are observed sequentially. All sequences are of the same finite length. The goal is to pick one element from each…

Statistics Theory · Mathematics 2024-02-06 Aristomenis Tsopelakos , Olgica Milenkovic

The problem of sequentially finding an independent and identically distributed (i.i.d.) sequence that is drawn from a probability distribution $F_1$ by searching over multiple sequences, some of which are drawn from $F_1$ and the others of…

Information Theory · Computer Science 2013-02-18 Jun Geng , Weiyu Xu , Lifeng Lai

In this article, we are interested in the high dimensional normal approximation of $T_n =\Big(\sum_{i=1}^{n}X_{i1}/\Big(\sqrt{\sum_{i=1}^{n}X_{i1}^2}\Big),\dots,$ $\sum_{i=1}^{n}X_{ip}/\Big(\sqrt{\sum_{i=1}^{n}X_{ip}^2}\Big)\Big)$ in…

Probability · Mathematics 2025-12-29 Debraj Das

We consider the \textsf{Unit Interval Selection} problem in the one-pass random order streaming model. Here, an algorithm is presented a sequence of $n$ unit-length intervals on the line that arrive in uniform random order, and the…

Data Structures and Algorithms · Computer Science 2026-03-11 Cezar-Mihail Alexandru , Adithya Diddapur , Magnús M. Halldórsson , Christian Konrad , Kheeran K. Naidu

We consider the \mnk{classical} problem of a controller activating (or sampling) sequentially from a finite number of $N \geq 2$ populations, specified by unknown distributions. Over some time horizon, at each time $n = 1, 2, \ldots$, the…

Machine Learning · Statistics 2015-12-18 Wesley Cowan , Michael N. Katehakis

When an interval of integers between the lower bound $l_i$ and the upper bound $u_i$ is the support of the marginal distribution $n_i|(n_{i-1}, ...,n_1)$, Chen et al, 2005 noticed that sampling from the interval at each step, for $n_i$…

Combinatorics · Mathematics 2018-01-19 Ruriko Yoshida , Jing Xi , Shaoceng Wei , Feng Zhou , David Haws

Let $X=(X_i)_{i\ge 1}$ and $Y=(Y_i)_{i\ge 1}$ be two sequences of independent and identically distributed (iid) random variables taking their values, uniformly, in a common totally ordered finite alphabet. Let LCI$_n$ be the length of the…

Probability · Mathematics 2018-08-27 Jean-Christophe Breton , Christian Houdré

This paper considers a two-color, single-draw urn model with two types of balls, denoted type $1$ and type $2$, with initial counts $Y^1_0\in N^+$ and $Y^2_0\in N^+$, respectively. At each discrete time step, a ball is drawn uniformly at…

Probability · Mathematics 2026-05-27 Jianan Shi , Qing Yin , Yu Miao