Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.10362

Pathwise Information Certificates for Decentralized Adaptive Sensing

Theodoros Tsiligkaridis
View original source ↗Read source document ↗Export metadata ↓

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.

Explore related subjects

cs.ITcs.LGmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Theodoros Tsiligkaridis. 2026-10-07. Pathwise Information Certificates for Decentralized Adaptive Sensing. https://arxiv.org/abs/2610.10362

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Symmetry-Enforced Quadratic Approximate-Degradability Bounds for Noisy Landau-Streater Channels

Understanding the limits of quantum communication is a central problem in quantum information theory. Structural properties of quantum channels provide tools for analyzing these limits. In particular, approximate degradability links quantum-capacity bounds to the accuracy with which a channel's environment can be reconstructed from its output. We study this reconstruction problem for noisy Landau-Streater channels across finite-spin representations. For spin $j$ and noise probability $p$, we construct an explicit degrading map with diamond-norm error at most $[2+8/(j(j+1))]p^2\le(38/3)p^2$ on the common interval $0\le p\le1/8$. A lower bound establishes quadratic order for this construction at each fixed spin. Floating-point semidefinite optimization places its error within $2.48\%$ of the numerical optimum on the sampled grid for four spins. Covariance and conditional-entropy concavity yield explicit two-sided quantum-capacity bounds for this family with a spin-uniform remainder. Building on the low-noise Pauli cancellation strategy, we formulate a sufficient condition based on a common scalar adjoint action on fixed, possibly nonunitary noise Kraus operators. The resulting reconstruction-error bound is uniform in system dimension and Kraus count. The criterion applies to irreducible $SU(N)$ generator channels and noisy Werner-Holevo channels, with the $SU(3)$ adjoint representation providing an example outside the mixed-unitary class.

cs.IT↗
arXiv2026

A Spectral Representation Of The Simple Hypothesis Testing Problem

The minimum Type II error probability (or volume) of simple hypothesis tests with randomized detectors is expressed as a Riemann integral of the (cumulative) distribution function of the likelihood ratio for all non-negative Type I error probability (or volume) values: $β(\varepsilon)=\int_{0}^{\infty}|F(1/τ)-\varepsilon|^{+}dτ$ for all $\varepsilon\geq0$. The derivation relies on convex conjugation (the Legendre transform) and level set integration, and is sufficiently general to extend to tests between $σ$-finite measures. Measure change identities relating the $β(\cdot)$ functions of different hypothesis testing problems are established. Approximations for Type II and Type I volumes are derived under two different hypotheses concerning the Kolmogorov distance to normality for the log-likelihood ratio distributions. In both the Central Limit Theorem and the large deviations regimes, the resulting non-asymptotic expressions recover and extend state-of-the-art characterizations of optimal performance in the memoryless case, and improve and generalize them in the Markovian case. Finally, The distinction between the implications of the Central Limit Theorem and the Berry--Esseen Theorem for the asymptotic simple hypothesis testing problem is clarified.

cs.IT↗
arXiv2026

Out-of-Air Computation: Enabling Structured Function Extraction from Wireless Superposition

Over-the-air computation (AirComp) broadly exploits the superposition property of wireless multiple-access channels (MACs) to compute functions of distributed data. Within this broad class, dominant conventional designs are embedding-oriented: they pre-shape transmitted signals or mitigate channel effects so that the received superposition directly realizes the prescribed computation, often requiring the MAC to approximate an ideal computational medium. This paper introduces out-of-air computation (AirCPU) and establishes an extraction-oriented paradigm for AirComp. Built on joint source-channel coding, AirCPU creates a structured wireless superposition from which the receiver extracts the target function. AirCPU operates directly on continuous-valued device data, avoiding the need for a separate source quantization stage, and employs a multi-layer nested lattice architecture that enables progressive resolution by decomposing each input into hierarchically scaled components, all transmitted over a common bounded digital constellation under a fixed power constraint. We formalize the notion of decoupled resolution, showing that in operating regimes where the decoding error probability is sufficiently small, the impact of channel noise and finite constellation constraints on distortion becomes negligible, and the resulting computation error is primarily determined by the target resolution set by the finest lattice. For fading MACs, we further introduce collective and successive computation mechanisms, in addition to the proposed direct computation, which exploit multiple decoded integer-coefficient functions and side-information functions as structural representations of the wireless superposition to significantly expand the reliable operating regime.

cs.IT↗