Skip to content
DraconiticResearch
Search Sources API
194,220 studies31 sourcesUpdated 9 min ago
PreprintCC BY 4.0arXiv

Sequential Lossy Compression With Causal Conditional Perception

Abstract

In this paper, we study sequential lossy compression under a causal conditional perception criterion comparing source and reconstruction distributions given the same reconstruction history. For first-order Markov sources, we formulate the finite-horizon nonanticipative rate-distortion-perception function (NRDPF) with stagewise constraints and establish one-shot lower and upper bounds on the minimum variable-length sum rate using a strengthened strong functional-representation lemma (SFRL) and common randomness. For time-varying scalar Gauss--Markov sources under pointwise mean-squared error (MSE) and conditional squared Wasserstein-$2$ fidelity, we prove Gaussian optimality, derive a log-variance characterization, and obtain a closed-form solution that recovers the classical Gaussian nonanticipative rate-distortion function (NRDF) when perception is unconstrained and the classical Gaussian RDPF when the source is stationary and memoryless.

Related

  1. Adaptive Local Proper Orthogonal Decomposition via Graph Partitioning and Provable Error-Bounded Lossy Compression for Parametric Series in Finite-Dimensional Function Spaces
    Roberto Nuca, Matteo Parsani, Lisandro Dalcin
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  2. Cadence: Error-Bounded Lossy Compression of Demand Time Series with a Time-Series Foundation Model
    Roberto Tacconelli
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  3. The Hidden Perception Constraint in Task-Aware Compression
    Sahan Liyanaarachchi, Semih Akkoc, Sennur Ulukus +1
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  4. Sequential Functional Structured Tucker Compression for Large Language Model Attentions
    Jiangfeng Chen, Xinyu Wang, Tianshuo Yan +4
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  5. Parameter estimation in Conditional Sequential Monte Carlo algorithms through Particle Learning
    Alfonso Diz-Lois Palomares, Geir Storvik
    arXivPreprintCC BY-NC-ND 4.0Full textStatisticsarXiv
BibTeX
@misc{stavrou2026sequential,
  title = {{Sequential Lossy Compression With Causal Conditional Perception}},
  author = {Photios A. Stavrou and Zixuan He},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.08611},
  eprint = {2609.08611},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.08611},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Sequential Lossy Compression With Causal Conditional Perception
AU  - Photios A. Stavrou
AU  - Zixuan He
PY  - 2026
DA  - 2026/09/08
PB  - arXiv
DO  - 10.48550/arxiv.2609.08611
UR  - https://arxiv.org/abs/2609.08611
AB  - In this paper, we study sequential lossy compression under a causal conditional perception criterion comparing source and reconstruction distributions given the same reconstruction history. For first-order Markov sources, we formulate the finite-horizon nonanticipative rate-distortion-perception function (NRDPF) with stagewise constraints and establish one-shot lower and upper bounds on the minimum variable-length sum rate using a strengthened strong functional-representation lemma (SFRL) and common randomness. For time-varying scalar Gauss--Markov sources under pointwise mean-squared error (MSE) and conditional squared Wasserstein-$2$ fidelity, we prove Gaussian optimality, derive a log-variance characterization, and obtain a closed-form solution that recovers the classical Gaussian nonanticipative rate-distortion function (NRDF) when perception is unconstrained and the classical Gaussian RDPF when the source is stationary and memoryless.
ER  -