Distributed recursive testing of composite hypothesis in multi-agent networks

Anit Kumar Sahu, S. Kar
{"title":"Distributed recursive testing of composite hypothesis in multi-agent networks","authors":"Anit Kumar Sahu, S. Kar","doi":"10.1049/pbce117e_ch8","DOIUrl":null,"url":null,"abstract":"This chapter considers the problem of recursive composite hypothesis testing in a network of sparsely connected agents. In classical centralized composite hypothesis testing, procedures such as the generalized likelihood ratio test (GLRT), i.e., the detection procedure which uses the underlying parameter estimate based on all the collected samples as a plug-in estimate, may exhibit poor performance until a reasonably accurate parameter estimate (typically the maximum likelihood estimate of the underlying parameter/state) is obtained. Usually in setups that employ the classical (centralized) GLRTs, the data-collection phase precedes the parameter estimation and detection statistic update phase, thus rendering the testing an essentially offline batch procedure. The motivation behind studying distributed recursive online detection algorithms in contrast to offline batch processing based detection algorithms is that in most multi-agent networked scenarios, which are typically energy constrained, the priority is to obtain reasonable inference performance by expending fewer amount of resources.","PeriodicalId":404571,"journal":{"name":"Data Fusion in Wireless Sensor Networks: A statistical signal processing perspective","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Data Fusion in Wireless Sensor Networks: A statistical signal processing perspective","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1049/pbce117e_ch8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This chapter considers the problem of recursive composite hypothesis testing in a network of sparsely connected agents. In classical centralized composite hypothesis testing, procedures such as the generalized likelihood ratio test (GLRT), i.e., the detection procedure which uses the underlying parameter estimate based on all the collected samples as a plug-in estimate, may exhibit poor performance until a reasonably accurate parameter estimate (typically the maximum likelihood estimate of the underlying parameter/state) is obtained. Usually in setups that employ the classical (centralized) GLRTs, the data-collection phase precedes the parameter estimation and detection statistic update phase, thus rendering the testing an essentially offline batch procedure. The motivation behind studying distributed recursive online detection algorithms in contrast to offline batch processing based detection algorithms is that in most multi-agent networked scenarios, which are typically energy constrained, the priority is to obtain reasonable inference performance by expending fewer amount of resources.
多智能体网络中复合假设的分布递归检验
本章研究了稀疏连接智能体网络中的递归复合假设检验问题。在经典的集中式复合假设检验中,诸如广义似然比检验(GLRT)之类的程序,即使用基于所有收集样本的底层参数估计作为插件估计的检测程序,在获得合理准确的参数估计(通常是底层参数/状态的最大似然估计)之前可能表现不佳。通常在使用经典(集中式)glrt的设置中,数据收集阶段先于参数估计和检测统计更新阶段,从而使测试实质上成为离线批处理过程。与基于离线批处理的检测算法相比,研究分布式递归在线检测算法的动机是,在大多数能量受限的多智能体网络场景中,优先考虑的是在消耗较少的资源的情况下获得合理的推理性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书