面向去中心化自适应感知的路径级信息证书

View PDF HTML (experimental)

Abstract:We study decentralized adaptive sensing, where multiple agents choose measurements from evolving local beliefs while exchanging information over a communication graph. We ask whether the measurements actually selected by an adaptive policy have collected enough evidence to distinguish the true target from every plausible alternative. We develop a pathwise certificate based on the Rényi--Chernoff information accumulated along the realized sensing trajectory. It yields nonasymptotic MAP-error bounds and an anytime, network-wide stopping rule for arbitrary history-dependent sensing policies, while separating accumulated statistical information from a bounded network-mixing transient. Linear growth of the information against the least-resolved competitor implies exponential decay of MAP and squared-localization error. A classical pairwise KL converse, specialized to the adaptive decentralized transcript, shows that insufficient information on any pair prevents a positive uniform error exponent, confirming the hardest competitor as a fundamental bottleneck. Across policies, graph topologies, sensor profiles, and seeds, the worst-competitor score correlates more strongly with localization speed than an average-pair proxy in both 1D ($r=0.89$ versus $0.40$) and structured 2D sensing ($r=0.77$ versus $0.48$). Our results provide a practical way to certify and diagnose adaptive multi-agent sensing systems using the evidence they actually collect.

Comments:	26 pages, preprint
Subjects:	Information Theory (cs.IT); Machine Learning (cs.LG)
Cite as:	arXiv:2610.10362 [cs.IT]
	(or arXiv:2610.10362v1 [cs.IT] for this version)
	https://doi.org/10.48550/arXiv.2610.10362 arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Theodoros Tsiligkaridis [view email]
[v1] Wed, 7 Oct 2026 16:32:17 UTC (719 KB)