Lower Bounds on the Minimax Risk for the Source Localization Problem

被引:0
|
作者
Venkatesh, Praveen [1 ]
Grover, Pulkit
机构
[1] Carnegie Mellon Univ, Elect & Comp Engn, Pittsburgh, PA 15213 USA
基金
美国安德鲁·梅隆基金会;
关键词
NOISE; BRAIN; EEG;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The "source localization" problem is one in which we estimate the location of a point source observed through a diffusive medium using an array of sensors. We obtain lower bounds on the minimax risk (mean squared-error in location) in estimating the location of the source, which apply to all estimators, for certain classes of diffusive media, when using a uniformly distributed sensor array. We show that for sensors of a fixed size, the lower bound decays to zero with increasing numbers of sensors. We also analyze a more physical sensor model to understand the effect of shrinking the size of sensors as their number increases to infinity, wherein the bound saturates for large sensor numbers. In this scenario, it is seen that there is greater benefit to increasing the number of sensors as the signal-to-noise ratio increases. Our bounds are the first to give a scaling for the minimax risk in terms of the number of sensors used.
引用
收藏
页数:5
相关论文
共 50 条
  • [31] Upper and lower bounds on the mean of noisy speech: Application to minimax classification
    Afify, M
    Siohan, O
    Lee, CH
    IEEE TRANSACTIONS ON SPEECH AND AUDIO PROCESSING, 2002, 10 (02): : 79 - 88
  • [32] Episodic Reinforcement Learning in Finite MDPs: Minimax Lower Bounds Revisited
    Domingues, Omar Darwiche
    Menard, Pierre
    Kaufmann, Emilie
    Valko, Michal
    ALGORITHMIC LEARNING THEORY, VOL 132, 2021, 132
  • [33] Minimax principle and lower bounds in H2-rational approximation
    Baratchart, Laurent
    Chevillard, Sylvain
    Qian, Tao
    JOURNAL OF APPROXIMATION THEORY, 2016, 206 : 17 - 47
  • [34] LOWER BOUNDS FOR THE CYCLE DETECTION PROBLEM
    FICH, FE
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1983, 26 (03) : 392 - 409
  • [35] On Bayes Risk Lower Bounds
    Chen, Xi
    Guntuboyina, Adityanand
    Zhang, Yuchen
    JOURNAL OF MACHINE LEARNING RESEARCH, 2016, 17 : 1 - 58
  • [36] Lower bounds for a practical scheduling problem
    Cavalcante, VF
    Passos, CAS
    MANAGEMENT AND CONTROL OF PRODUCTION AND LOGISTICS, VOL 1 AND 2, 1998, : 271 - 276
  • [37] Lower Bounds for the Graph Homomorphism Problem
    Fomin, Fedor V.
    Golovnev, Alexander
    Kulikov, Alexander S.
    Mihajlin, Ivan
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2015, 9134 : 481 - 493
  • [38] Lower bounds for the noisy broadcast problem
    Goyal, Navin
    Kindler, Guy
    Saks, Michael
    SIAM JOURNAL ON COMPUTING, 2008, 37 (06) : 1806 - 1841
  • [39] UPPER AND LOWER BOUNDS FOR THE DICTIONARY PROBLEM
    DIETZFELBINGER, M
    MEHLHORN, K
    HEIDE, FM
    ROHNERT, H
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 318 : 214 - 215
  • [40] LOWER BOUNDS FOR THE HUB LOCATION PROBLEM
    OKELLY, M
    SKORINKAPOV, D
    SKORINKAPOV, J
    MANAGEMENT SCIENCE, 1995, 41 (04) : 713 - 721