Papers › On Optimal Quantization in Sequential Detection
On Optimal Quantization in Sequential Detection
Michael Fauß, Manuel S. Stein, H. Vincent Poor
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The problem of designing optimal quantization rules for sequential detectors is investigated. First, it is shown that this task can be solved within the general framework of active sequential detection. Using this approach, the optimal sequential detector and the corresponding quantizer are characterized and their properties are briefly discussed. In particular, it is shown that designing optimal quantization rules requires solving a nonconvex optimization problem, which can lead to issues in terms of computational complexity and numerical stability. Motivated by these difficulties, two performance bounds are proposed that are easier to evaluate than the true performance measures and are potentially tighter than the bounds currently available in the literature. The usefulness of the bounds and the properties of the optimal quantization rules are illustrated with two numerical examples.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections