Positivity of Cumulative Sums for Multi-Index Function Components Explains the Lower Bound Formula in the Levin-Robbins-Leu Family of Sequential Subset Selection Procedures

09/05/2020
by   Bruce Levin, et al.
0

We exhibit some strong positivity properties of a certain function which implies a key inequality that in turn implies the lower bound formula for the probability of correct selection in the Levin-Robbins-Leu family of sequential subset selection procedures for binary outcomes. These properties provide a more direct and comprehensive demonstration of the key inequality than was discussed in previous work.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/14/2018

A better lower bound on the family complexity of binary Legendre sequence

In this paper we study a family of binary Legendre sequences and its fam...
research
05/12/2022

An MMSE Lower Bound via Poincaré Inequality

This paper studies the minimum mean squared error (MMSE) of estimating 𝐗...
research
07/14/2018

About the lower bounds for the multiple testing problem

Given an observed random variable, consider the problem of recovering it...
research
07/17/2018

A tight lower bound for the hardness of clutters

A clutter (or antichain or Sperner family) L is a pair (V,E), where V...
research
07/23/2020

A lower bound for the dimension of tetrahedral splines in large degree

We derive a formula which is a lower bound on the dimension of trivariat...
research
04/18/2021

Efficient Fully Sequential Indifference-Zone Procedures Using Properties of Multidimensional Brownian Motion Exiting a Sphere

We consider a ranking and selection (R S) problem with the goal to sel...
research
05/26/2023

An Analysis of the Johnson-Lindenstrauss Lemma with the Bivariate Gamma Distribution

Probabilistic proofs of the Johnson-Lindenstrauss lemma imply that rando...

Please sign up or login with your details

Forgot password? Click here to reset