On Optimal Quantization in Sequential Detection

Author name not available (Why is that?)

Publication date: 28 July 2021

Abstract: 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.

Has companion code repository: https://github.com/mifauss/QSPRT

This page was built for publication: On Optimal Quantization in Sequential Detection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6373947)