Single-Shot Compression for Hypothesis Testing

07/20/2021
by   Fabrizio Carpi, et al.
0

Enhanced processing power in the cloud allows constrained devices to offload costly computations: for instance, complex data analytics tasks can be computed by remote servers. Remote execution calls for a new compression paradigm that optimizes performance on the analytics task within a rate constraint, instead of the traditional rate-distortion framework which focuses on source reconstruction. This paper considers a simple binary hypothesis testing scenario where the resource constrained client (transmitter) performs fixed-length single-shot compression on data sampled from one of two distributions; the server (receiver) performs a hypothesis test on multiple received samples to determine the correct source distribution. To this end, the task-aware compression problem is formulated as finding the optimal source coder that maximizes the asymptotic error performance of the hypothesis test on the server side under a rate constraint. A new source coding strategy based on a greedy optimization procedure is proposed and it is shown that that the proposed compression scheme outperforms universal fixed-length single-shot coding scheme for a range of rate constraints.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/19/2018

Distributed Hypothesis Testing Over Discrete Memoryless Channels

A distributed binary hypothesis testing problem is studied in which mult...
research
02/19/2018

Distributed Hypothesis Testing Over Orthogonal Discrete Memoryless Channels

A distributed binary hypothesis testing problem is studied in which mult...
research
09/17/2021

Distributed Sequential Hypothesis Testing With Zero-Rate Compression

In this paper, we consider sequential testing over a single-sensor, a si...
research
11/30/2020

On Error Exponents of Almost-Fixed-Length Channel Codes and Hypothesis Tests

We examine a new class of channel coding strategies, and hypothesis test...
research
08/28/2021

Statistical Classification via Robust Hypothesis Testing: Non-Asymptotic and Simple Bounds

We consider Bayesian multiple statistical classification problem in the ...
research
01/16/2023

Strong Converses using Typical Changes of Measures and Asymptotic Markov Chains

The paper presents exponentially-strong converses for source-coding, cha...
research
09/18/2020

Bounds for Learning Lossless Source Coding

This paper asks a basic question: how much training is required to beat ...

Please sign up or login with your details

Forgot password? Click here to reset