Pith. sign in

REVIEW 1 cited by

An Upper Confidence Bound Approach to Estimating the Maximum Mean

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2408.04179 v1 pith:BL5QJ7DD submitted 2024-08-08 math.ST cs.LGstat.MLstat.TH

classification math.STcs.LGstat.MLstat.TH
keywords meanmaximumconfidenceapproachaverageboundcltsestimating
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Estimating the maximum mean finds a variety of applications in practice. In this paper, we study estimation of the maximum mean using an upper confidence bound (UCB) approach where the sampling budget is adaptively allocated to one of the systems. We study in depth the existing grand average (GA) estimator, and propose a new largest-size average (LSA) estimator. Specifically, we establish statistical guarantees, including strong consistency, asymptotic mean squared errors, and central limit theorems (CLTs) for both estimators, which are new to the literature. We show that LSA is preferable over GA, as the bias of the former decays at a rate much faster than that of the latter when sample size increases. By using the CLTs, we further construct asymptotically valid confidence intervals for the maximum mean, and propose a single hypothesis test for a multiple comparison problem with application to clinical trials. Statistical efficiency of the resulting point and interval estimates and the proposed single hypothesis test is demonstrated via numerical examples.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. From Theory to Practice with RAVEN-UCB: Addressing Non-Stationarity in Multi-Armed Bandits through Variance Adaptation

    cs.LG 2025-06 reject novelty 4.0 of 10

    RAVEN-UCB proposes a variance-adaptive UCB algorithm for non-stationary bandits, but the proof of its main regret bound is mathematically invalid.

Pith tools