Optimal Grouping for Group Minimax Hypothesis Testing
Kush R. Varshney, Lav R. Varshney

TL;DR
This paper introduces an optimal grouping method for group minimax hypothesis testing by using quantization and Bregman divergence, improving robustness when prior knowledge is partial.
Contribution
It proposes a novel quantization-based approach to define groups and representative priors in group minimax testing, optimizing detection performance.
Findings
Optimal grouping is achieved via Bregman Voronoi diagrams.
The method provides an asymptotic rate-distortion analysis.
Examples include Gaussian noise detection and exponential signal discrimination.
Abstract
Bayesian hypothesis testing and minimax hypothesis testing represent extreme instances of detection in which the prior probabilities of the hypotheses are either completely and precisely known, or are completely unknown. Group minimax, also known as Gamma-minimax, is a robust intermediary between Bayesian and minimax hypothesis testing that allows for coarse or partial advance knowledge of the hypothesis priors by using information on sets in which the prior lies. Existing work on group minimax, however, does not consider the question of how to define the sets or groups of priors; it is assumed that the groups are given. In this work, we propose a novel intermediate detection scheme formulated through the quantization of the space of prior probabilities that optimally determines groups and also representative priors within the groups. We show that when viewed from a quantization…
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.
