Compression with actions

@article{Zhao2011CompressionWA,
  title={Compression with actions},
  author={Lei Zhao and Yeow-Khiang Chia and Tsachy Weissman},
  journal={2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)},
  year={2011},
  pages={164-171}
}
We consider the setting where actions can be used to modify a state sequence before compression. The minimum rate needed to losslessly describe the optimal modified sequence is characterized when the state sequence is either non-causally or causally available at the action encoder. The achievability is closely related to the optimal channel coding strategy for channel with states. We also extend the analysis to the the lossy case. 

Figures from this paper

Information Embedding on Actions
TLDR
The problem of embedding information on the actions is studied for both the source and the channel coding setups, and a single letter characterization of the achievable capacity-cost region is obtained.
Coding With Action-Dependent Side Information and Additional Reconstruction Requirements
TLDR
This work considers discrete memoryless systems and characterize single letter expressions for the rate-distortion-cost function and channel capacity for the respective source and channel coding problems.
Lossless coding of correlated sources with actions in acyclic directed networks
TLDR
For this network, generalized cut-set bounds are derived, and a full characterization of the set of achievable rates using single-letter expressions is provided, showing how actions affect the achievable region in a non-trivial manner.
Lossy Computing of Correlated Sources with Fractional Sampling
TLDR
This paper considers the problem of lossy compression for the computation of a function of two correlated sources, both of which are observed at the encoder, and shows the optimal measurement overlap fraction to depend on the function to be computed by the decoder, on the source statistics, including the correlation, and on the link rate.
Estimation With a Helper Who Knows the Interference
TLDR
It is shown that causal and noncausal estimation are not equivalent for this problem, and new lower bounds for this setting are developed that improve on those previously developed, and characterize the optimal distortion up to a constant multiplicative factor for some regimes of interest.
On Secure One-Helper Source Coding With Action-Dependent Side Information
TLDR
An inner bound of the achievable rate-distortion-cost-leakage is provided for the discrete memoryless setting and is shown to be tight when the side information can be influenced by a cost-constrained action sequence taken by the decoder.
Cascade Source Coding With a Side Information Vending Machine
TLDR
It is shown that a joint design of the description, source, and control signals used to guide the selection of the actions at downstream nodes is generally necessary for an efficient use of the available communication links.
Two‐way communication with adaptive data acquisition
TLDR
A bidirectional link is studied in which two nodes communicate to fulfill generally conflicting informational requirements and the optimal trade‐off between communication rates, distortions of the information produced at the two nodes and costs for information acquisition at Node 2 is derived.
Two-way communication with adaptive data acquisition
A bidirectional link between two nodes, Node 1 and Node 2, is studied in which Node 2 is able to acquire information from the environment, e.g., via access to a remote data base or via sensing.
Lossless Coding of Correlated Sources With Actions
TLDR
Random linear network coding is proved to be optimal for the distributed compression of correlated sources with an action-dependent joint distribution, even though this is not a classical multicast problem.
...
...

References

SHOWING 1-10 OF 32 REFERENCES
Rate vs. distortion trade-off for channels with state information
TLDR
An achievable tradeoff region between pure information rate and state estimation error is proposed for a discrete memoryless channel with an arbitrary state distortion measure.
Lossy Compression of Discrete Sources via the Viterbi Algorithm
TLDR
This work identifies a choice of the coefficients used in the cost function which ensures that the algorithm universally achieves the optimum rate-distortion performance for any stationary ergodic source, in the limit of large , provided that increases as o(log n).
Information embedding meets distributed control
TLDR
It is shown that a dirty-paper coding based strategy achieves the optimal rate for perfect recovery of the modified host and the message, and the tightest known lower bounds on the asymptotic costs for the vector version of a famous open problem in distributed control - the Witsenhausen counterexample.
Block and Sliding-Block Lossy Compression via MCMC
TLDR
An approach to lossy compression of finite-alphabet sources that utilizes Markov chain Monte Carlo and simulated annealing methods and achieves optimum rate-distortion performance in the limits of large number of iterations, and sequence length, when employed on any stationary ergodic source.
State Amplification
TLDR
This work considers the problem of transmitting data at rate over a state-dependent channel with state information available at the sender and at the same time conveying the information about the channel state itself to the receiver and finds the maximum uncertainty reduction rate is given.
Lossy Computing of Correlated Sources with Fractional Sampling
TLDR
This paper considers the problem of lossy compression for the computation of a function of two correlated sources, both of which are observed at the encoder, and shows the optimal measurement overlap fraction to depend on the function to be computed by the decoder, on the source statistics, including the correlation, and on the link rate.
Estimation With a Helper Who Knows the Interference
TLDR
It is shown that causal and noncausal estimation are not equivalent for this problem, and new lower bounds for this setting are developed that improve on those previously developed, and characterize the optimal distortion up to a constant multiplicative factor for some regimes of interest.
On the capacity of computer memory with defects
TLDR
A computer memory with defects is modeled as a discrete memoryless channel with states that are statistically determined, and Arimoto-Blahut type algorithms are used to compute the storage capacity.
Source coding with side information and a converse for degraded broadcast channels
TLDR
In Section H of the paper, a characterization of the capacity region for degraded broadcast channels (DBC's) is given, which was conjectured by Bergmans and is somewhat sharper than the one obtained by Gallager.
Lossy communication of correlated sources over multiple access channels
  • S. Lim, P. Minero, Young-Han Kim
  • Computer Science
    2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2010
TLDR
A new approach to joint source-channel coding is presented in the context of communicating correlated sources over multiple access channels, whereby the source encoding and channel decoding operations are decoupled and the same codeword is used for both source coding and channel coding.
...
...