Pith. sign in

REVIEW

Efficient Distributed Non-Asymptotic Confidence Regions Computation over Wireless Sensor Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1409.8585 v1 pith:3P4BDWDW submitted 2014-09-29 cs.SY cs.SY

classification cs.SY
keywords confidenceregionscomputationdistributednon-asymptoticinformationmeasurementsnetworks
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

This paper considers the distributed computation of confidence regions tethered to multidimensional parameter estimation under linear measurement models. In particular, the considered confidence regions are non-asymptotic, this meaning that the number of required measurements is finite. Distributed solutions for the computation of non-asymptotic confidence regions are proposed, suited to wireless sensor networks scenarios. Their performances are compared in terms of required traffic load, both analytically and numerically. The evidence emerging from the conducted investigations is that the best solution for information exchange depends on whether the network topology is structured or unstructured. The effect on the computation of confidence regions of information diffusion truncation is also examined. In particular, it is proven that consistent confidence regions can be computed even when an incomplete set of measurements is available.

Discussion (0). Continue with ORCID to comment.

Pith tools