Resolution Limits of Non-Adaptive 20 Questions Search for Multiple Targets

01/18/2021 ∙ by Lin Zhou, et al. ∙ 0

We study the problem of simultaneous search for multiple targets over a multidimensional unit cube and derive the fundamental resolution limit of non-adaptive querying procedures using the 20 questions estimation framework. The performance criterion that we consider is the achievable resolution, which is defined as the maximal L_∞ norm between the location vector and its estimated version where the maximization is over the possible location vectors of all targets. The fundamental resolution limit is then defined as the minimal achievable resolution of any non-adaptive query procedure. We drive non-asymptotic and second-order asymptotic bounds on the minimal achievable resolution by relating the current problem to a data transmission problem over a multiple access channel, using the information spectrum method by Han and borrowing results from finite blocklength information theory for random access channel coding. Our results extend the purely first-order asymptotic analyses of Kaspi et al. (ISIT 2015) for the one-dimensional case. Specifically, we consider more general channels, derive the non-asymptotic and second-order asymptotic results and establish a phase transition phenomenon.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.