English
Related papers

Related papers: The Last Success Problem with Samples

200 papers

We study chance constrained optimization problems $\min_x f(x)$ s.t. $P(\left\{ \theta: g(x,\theta)\le 0 \right\})\ge 1-\epsilon$ where $\epsilon\in (0,1)$ is the violation probability, when the distribution $P$ is not known to the decision…

Machine Learning · Computer Science 2024-02-13 A Ch Madhusudanarao , Rahul Singh

Many discrete-time optimal stopping problems are known to have more tractable limit forms based on a planar Poisson process. Using this tool we find a solution to the optimal stopping problem for i.i.d. sequence of $n$ discrete uniform…

Probability · Mathematics 2026-01-09 Alexander Gnedin

This paper studies the sample complexity of searching over multiple populations. We consider a large number of populations, each corresponding to either distribution P0 or P1. The goal of the search problem studied here is to find one…

Information Theory · Computer Science 2016-11-17 Matthew L. Malloy , Gongguo Tang , Robert D. Nowak

In the best choice problem with random arrivals, an unknown number $n$ of rankable items arrive at times sampled from the uniform distribution. As is well known, a real-time player can ensure stopping at the overall best item with…

Probability · Mathematics 2021-03-09 Alexander Gnedin

We study the problem of setting a price for a potential buyer with a valuation drawn from an unknown distribution $D$. The seller has "data"' about $D$ in the form of $m \ge 1$ i.i.d. samples, and the algorithmic challenge is to use these…

Computer Science and Game Theory · Computer Science 2015-02-12 Zhiyi Huang , Yishay Mansour , Tim Roughgarden

Suppose a customer is faced with a sequence of fluctuating prices, such as for airfare or a product sold by a large online retailer. Given distributional information about what price they might face each day, how should they choose when to…

Data Structures and Algorithms · Computer Science 2019-10-10 Hossein Esfandiari , MohammadTaghi HajiAghayi , Brendan Lucier , Michael Mitzenmacher

In this paper, we investigate two variants of the secretary problem. In these variants, we are presented with a sequence of numbers $X_i$ that come from distributions $\mathcal{D}_i$, and that arrive in either random or adversarial order.…

Data Structures and Algorithms · Computer Science 2022-08-22 Pranav Nuti , Jan Vondrák

We solve the problem of optimal stopping of a Brownian motion subject to the constraint that the stopping time's distribution is a given measure consisting of finitely-many atoms. In particular, we show that this problem can be converted to…

Optimization and Control · Mathematics 2017-07-07 Erhan Bayraktar , Christopher W. Miller

We consider the problem of hypothesis testing for discrete distributions. In the standard model, where we have sample access to an underlying distribution $p$, extensive research has established optimal bounds for uniformity testing,…

Machine Learning · Computer Science 2024-12-03 Maryam Aliakbarpour , Piotr Indyk , Ronitt Rubinfeld , Sandeep Silwal

We use the exact finite sample likelihood and statistical decision theory to answer questions of ``why?'' and ``what should you have done?'' using data from randomized experiments and a utility function that prioritizes safety over…

Econometrics · Economics 2024-07-26 Neil Christy , A. E. Kowalski

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

We consider a discounted infinite horizon optimal stopping problem. If the underlying distribution is known a priori, the solution of this problem is obtained via dynamic programming (DP) and is given by a well known threshold rule. When…

Machine Learning · Computer Science 2021-02-23 Daniel Russo , Assaf Zeevi , Tianyi Zhang

Optimal stopping problems give rise to random distributions describing how many applicants the decision-maker will sample or interview before choosing one, a quantity sometimes referred to as the search time or process duration. This…

Applications · Statistics 2019-12-13 Simon Demers

Candidates arrive sequentially for an interview process which results in them being ranked relative to their predecessors. Based on the ranks available at each time, one must develop a decision mechanism that selects or dismisses the…

Data Structures and Algorithms · Computer Science 2024-05-08 George V. Moustakides , Xujun Liu , Olgica Milenkovic

While techniques have been developed for chance constrained stochastic optimal control using sample disturbance data that provide a probabilistic confidence bound for chance constraint satisfaction, far less is known about how to use sample…

Systems and Control · Electrical Eng. & Systems 2023-03-31 Shawn Priore , Meeko Oishi

We present novel bounds for estimating discrete probability distributions under the $\ell_\infty$ norm. These are nearly optimal in various precise senses, including a kind of instance-optimality. Our data-dependent convergence guarantees…

Statistics Theory · Mathematics 2024-02-14 Aryeh Kontorovich , Amichai Painsky

A central object in optimal stopping theory is the single-choice prophet inequality for independent, identically distributed random variables: Given a sequence of random variables $X_1,\dots,X_n$ drawn independently from a distribution $F$,…

Data Structures and Algorithms · Computer Science 2021-04-08 José R. Correa , Paul Dütting , Felix Fischer , Kevin Schewior

The impetus for writing this paper are the well publicized media reports that software failure was the cause of the two recent mishaps of the Boeing 737 Max aircraft. The problem considered here though, is a specific one, in the sense that…

Other Statistics · Statistics 2020-03-09 Nozer D. Singpurwalla , Boya Lai

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

How can we monitor, in real time, whether one uncertain prospect has any upside over another? To answer this question, we develop a novel family of sequential, anytime-valid tests for stochastic dominance (SD; also known as stochastic…

Methodology · Statistics 2026-04-24 Sebastian Arnold , Yo Joong Choe , Marco Scarsini , Ilia Tsetlin