Distributed testing against independence with multiple terminals

Zhao, Wenwen; Lai, Lifeng

doi:10.1109/allerton.2014.7028598

Cited by 33 publications

(29 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our model is related to but different from several existing interesting work [4], [7]- [9], [11]. The first class of existing work, such as [8] and [9], considered the case with only one encoder that has full access to (X n 1 , · · · , X n L ) (which can then be viewed as a single super-variable X n = (X n 1 , · · · , X n L )), while in our model each of the L encoders has access to only partial information.…”

Section: Modelmentioning

confidence: 96%

“…The first class of existing work, such as [8] and [9], considered the case with only one encoder that has full access to (X n 1 , · · · , X n L ) (which can then be viewed as a single super-variable X n = (X n 1 , · · · , X n L )), while in our model each of the L encoders has access to only partial information. The second class of existing work, such as [4], [7], [11], considered the case with a less strict type 1 error probability constraint than (6). In particular, [4], [7], [11] studied a constant-type constraint in which one requires…”

Section: Modelmentioning

confidence: 98%

“…The second class of existing work, such as [4], [7], [11], considered the case with a less strict type 1 error probability constraint than (6). In particular, [4], [7], [11] studied a constant-type constraint in which one requires…”

Section: Modelmentioning

confidence: 98%

“…This paper builds upon our recent work [4], in which we studied a special case with Q X1···XLY = P X1···XL P Y , i.e., testing against independence case, under a constant-type type 1 error probability constraint (i.e., the type 1 error probability is required to be less than a given constant) and non-zero communication rate constraints. In this paper, we generalize our work [4] by imposing more strict constraints. In particular, we consider the problem with the general form of PMF, i.e., Q X1···XLY is not limited to be P X1···XL P Y anymore.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Distributed testing with zero-rate compression

Zhao

Lai

2015

2015 IEEE International Symposium on Information Theory (ISIT)

Self Cite

View full text Add to dashboard Cite

Motivated by distributed inference over big datasets problems, we study multi-terminal distributed hypothesis testing problems in which each terminal has data related to only one random variable. We consider a case of practical interest in which each terminal is allowed to send zero-rate messages to a decision maker. Subject to a constraint that the error exponent of the type 1 error probability is larger than a certain level, we characterize the best error exponent of the type 2 error probability using basic properties of the r-divergent sequences.

show abstract

Section: Modelmentioning

confidence: 96%

Section: Modelmentioning

confidence: 98%

Section: Modelmentioning

confidence: 98%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Distributed testing with zero-rate compression

Zhao

Lai

2015

2015 IEEE International Symposium on Information Theory (ISIT)

Self Cite

View full text Add to dashboard Cite

show abstract

“…The TACI is first studied in [3], where the optimality of a random binning based encoding scheme is shown. Various multi-terminal scenarios have been studied in [4] and [5]. Recently, the optimal T2EE for TACI over a noisy channel is established in [6].…”

Section: Introductionmentioning

confidence: 99%

Testing Against Conditional Independence Under Security Constraints

Sreekumar

Gündüz

2018

2018 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

A distributed binary hypothesis testing problem involving three parties, a remote node, called the observer, a legitimate decoder, called the detector, and an adversary, is studied. The remote node observes a discrete memoryless source, and communicates its observations over a rate-limited noiseless public channel to the detector, which tests for the conditional independence of its own observations from that of the remote node, conditioned on some additional side information. The adversary, in addition to observing the public message, has access to its own correlated side-information. Considering the type 2 error exponent for a given type 1 error probability constraint as the performance measure for the hypothesis test at the detector, and equivocation of the source at the adversary as the secrecy measure, a single-letter characterization of the rate-error exponent-equivocation trade-off is established. Additionally, for a general distortion measure, imposing the average distortion at the adversary as the measure of secrecy achieved, an inner bound on the trade-off between the rate, error exponent and average distortion is obtained. This bound is shown to be tight under the less noisy condition on the adversary's side information.

show abstract

Distributed Statistical Inference with Compressed Data

Zhao¹,

Lai²

2021

Information-Theoretic Methods in Data Science

View full text Add to dashboard Cite

Distributed testing against independence with multiple terminals

Cited by 33 publications

References 8 publications

Distributed testing with zero-rate compression

Distributed testing with zero-rate compression

Testing Against Conditional Independence Under Security Constraints

Distributed Statistical Inference with Compressed Data

Contact Info

Product

Resources

About