Hypothesis Testing via Affine Detectors
Anatoli Juditsky, Arkadi Nemirovski

TL;DR
This paper advances a computational approach to hypothesis testing using convex programming, extending affine detectors to broader problems, sacrificing some optimality for wider applicability and operational efficiency.
Contribution
It extends the affine detector-based hypothesis testing framework to a wider class of problems, emphasizing computational methods over traditional analytic separation.
Findings
Extended testing routines to various problems.
Maintained near-optimal risk in specific schemes.
Broadened applicability beyond traditional models.
Abstract
In this paper, we further develop the approach, originating in [GJN], to "computation-friendly" hypothesis testing via Convex Programming. Most of the existing results on hypothesis testing aim to quantify in a closed analytic form separation between sets of distributions allowing for reliable decision in precisely stated observation models. In contrast to this descriptive (and highly instructive) traditional framework, the approach we promote here can be qualified as operational -- the testing routines and their risks are yielded by an efficient computation. All we know in advance is that, under favorable circumstances, specified in [GJN], the risk of such test, whether high or low, is provably near-optimal under the circumstances. As a compensation for the lack of "explanatory power," this approach is applicable to a much wider family of observation schemes and hypotheses to be tested…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
