Related papers: Compression with Actions
Action-dependent channels model scenarios in which transmission takes place in two successive phases. In the first phase, the encoder selects an "action" sequence, with the twofold aim of conveying information to the receiver and of…
The problem of communication and state estimation is considered in the context of channels with actiondependent states. Given the message to be communicated, the transmitter chooses an action sequence that affects the formation of the…
We consider the problem of the optimal compression rate in the case of the source producing mixed signal states within the {\it visible} scheme (where Alice, who is to compress the signal, can know the identities of the produced states). We…
We extend Ziv and Lempel's model of finite-state encoders to the realm of lossy compression of individual sequences. In particular, the model of the encoder includes a finite-state reconstruction codebook followed by an information lossless…
This work studies the problem of distributed compression of correlated sources with an action-dependent joint distribution. This class of problems is, in fact, an extension of the Slepian-Wolf model, but where cost-constrained actions taken…
We provide a rate distortion interpretation of the problem of quantum data compression of ensembles of mixed states with commuting density operators. There are two versions of this problem. In the visible case the sequence of states is…
In this paper, we consider controlled linear dynamical systems in which the controller has only access to a compressed version of the system state. The technical problem we investigate is that of allocating compression resources over time…
Organisms have to keep track of the information in the environment that is relevant for adaptive behaviour. Transmitting information in an economical and efficient way becomes crucial for limited-resourced agents living in high-dimensional…
The problem of optimal actuation for channel and source coding was recently formulated and solved in a number of relevant scenarios. In this class of models, actions are taken at encoders or decoders, either to acquire side information in…
We consider the problem of deciding whether a given state preparation, i.e., a source of quantum states, is accurate, namely produces states close to a target one within a prescribed threshold. We show that, when multiple measurements need…
We consider the problem of successive-refinement coding for lossy compression of individual sequences, namely, compression in two stages, where in the first stage, a coarse description at a relatively low rate is sent from the encoder to…
We study the problem of compressing a source sequence in the presence of side-information that is related to the source via insertions, deletions and substitutions. We propose a simple algorithm to compress the source sequence when the…
Most of the world's digital data is currently encoded in a sequential form, and compression methods for sequences have been studied extensively. However, there are many types of non-sequential data for which good compression techniques are…
What defines an action like "kicking ball"? We argue that the true meaning of an action lies in the change or transformation an action brings to the environment. In this paper, we propose a novel representation for actions by modeling an…
When a model makes a consequential decision, e.g., denying someone a loan, it needs to additionally generate actionable, realistic feedback on what the person can do to favorably change the decision. We cast this problem through the lens of…
The ubiquity and energy needs of industrial refrigeration has prompted several research studies investigating various control opportunities for reducing energy demand. This work focuses on one such opportunity, termed compressor sequencing,…
We consider the problem of optimal asymptotically faithful compression for ensembles of mixed quantum states. Although the optimal rate is unknown, we prove upper and lower bounds and describe a series of illustrative examples of…
Problems dealing with the ability to take an action that affects the states of state-dependent communication channels are of timely interest and importance. Therefore, we extend the study of action-dependent channels, which until now…
We design quantum compression algorithms for parametric families of tensor network states. We first establish an upper bound on the amount of memory needed to store an arbitrary state from a given state family. The bound is determined by…
We consider state changes in quantum theory due to "conditional action" and relate these to the discussion of entropy decrease due to interventions of "intelligent beings" and the principles of Szilard and Landauer/Bennett. The mathematical…