Active Sequential Hypothesis Testing With Non-Homogeneous Costs

We study the Non-Homogeneous Sequential Hypothesis Testing (NHSHT), where a single active Decision-Maker (DM) selects actions with heterogeneous positive costs to identify the true hypothesis under an average error constraint δ, while minimizing expected total cost paid. Under standard arguments, we show that the objective decomposes into the product of the mean number of samples and the mean per-action cost induced by the policy. This leads to a key design principle: one should optimize the ratio of expectations (expected information gain per expected cost) rather than the expectation of per-step information-per-cost ("bit-per-buck"), which can be suboptimal. We adapt the Chernoff scheme to NHSHT, preserving its classical log1/δ scaling. In simulations, the adapted scheme reduces mean cost by up to 50% relative to the classic Chernoff policy and by up to 90% relative to the naive bit-per-buck heuristic.

Authors

Institutions

Publication Details

Published
2026-04-21
DOI
https://doi.org/10.1109/icassp55912.2026.11463839
Primary Topic
Distributed Sensor Networks and Detection Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Active Sequential Hypothesis Testing With Non-Homogeneous Costs

George Vershinin, Omer Gurewitz, Asaf Cohen
Distributed Sensor Networks and Detection Algorithms
article

Active Sequential Hypothesis Testing With Non-Homogeneous Costs

George Vershinin, Omer Gurewitz, Asaf Cohen
article en

Abstract

We study the Non-Homogeneous Sequential Hypothesis Testing (NHSHT), where a single active Decision-Maker (DM) selects actions with heterogeneous positive costs to identify the true hypothesis under an average error constraint δ, while minimizing expected total cost paid. Under standard arguments, we show that the objective decomposes into the product of the mean number of samples and the mean per-action cost induced by the policy. This leads to a key design principle: one should optimize the ratio of expectations (expected information gain per expected cost) rather than the expectation of per-step information-per-cost ("bit-per-buck"), which can be suboptimal. We adapt the Chernoff scheme to NHSHT, preserving its classical log1/δ scaling. In simulations, the adapted scheme reduces mean cost by up to 50% relative to the classic Chernoff policy and by up to 90% relative to the naive bit-per-buck heuristic.

Ben-Gurion University of the Negev (IL)
Openalex Percentile: Top 99%
Distributed Sensor Networks and Detection Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.