Fixed-horizon Active Hypothesis Testing
Not on the map. Why?
Abstract (arXiv)
Two active hypothesis testing problems are formulated. In these problems, the agent can perform a fixed number of experiments and then decide on one of the hypotheses. The agent is also allowed to declare its experiments inconclusive if needed. The first problem is an asymmetric formulation in which the the objective is to minimize the probability of incorrectly declaring a particular hypothesis to be true while ensuring that the probability of correctly declaring that hypothesis is moderately high. This formulation can be seen as a generalization of the formulation in the classical Chernoff-Stein lemma to an active setting. The second problem is a symmetric formulation in which the objective is to minimize the probability of making an incorrect inference (misclassification probability) while ensuring that the true hypothesis is declared conclusively with moderately high probability. For these problems, lower and upper bounds on the optimal misclassification probabilities are derived and these bounds are shown to be asymptotically tight. Classical approaches for experiment selection suggest use of randomized and, in some cases, open-loop strategies. As opposed to these classical approaches, fully deterministic and adaptive experiment selection strategies are provided. It is shown that these strategies are asymptotically optimal and further, using numerical experiments, it is demonstrated that these novel experiment selection strategies (coupled with appropriate inference strategies) have a significantly better performance in the non-asymptotic regime.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 15 Nov 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 0; 2025: 0; 2026: 2.
4 papers.
- 2023TrustFed: A Reliable Federated Learning Framework with Malicious-Attack Resistancecited by 1
- 2026From Relative Entropy to Minimax: A Unified Framework for Coverage in MDPscited by 1
- 2022Resolution Limits of Non-Adaptive 20 Questions Search for a Moving Targetcited by 0
- 2026Inferring Hidden User Models from the Behavior of Personalized LLM Agentscited by 0
- 2026Inferring Hidden User Models from the Behavior of Personalized LLM Agents3 Sep 2026
- 2026From Relative Entropy to Minimax: A Unified Framework for Coverage in MDPs17 Jan 2026
- 2023TrustFed: A Reliable Federated Learning Framework with Malicious-Attack Resistance6 Dec 2023
- 2022Resolution Limits of Non-Adaptive 20 Questions Search for a Moving Target14 Jun 2022