Predictive-State Communication: Innovation Coding and Reconciliation under Delay

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Ercetin, Ozgur, Chraiti, Mohaned
Formato: Preprint
Publicado: 2026
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866910018768470016
author Ercetin, Ozgur
Chraiti, Mohaned
author_facet Ercetin, Ozgur
Chraiti, Mohaned
contents Shannon theory models communication as the reliable transfer of symbol sequences, with performance governed by capacity and rate-distortion limits. When both endpoints possess strong predictors -- as in modern large language models and related generative priors -- literal symbol transport is no longer the only operational regime. We propose predictive-state communication (PSC), in which the transmitter and receiver maintain an explicit shared predictive state, and the physical channel is used primarily to convey innovations, i.e., corrective information that reconciles the receiver's provisional trajectory with the transmitter's realized trajectory. This viewpoint replaces entropy-rate accounting by cross-entropy accounting under model mismatch, and it introduces feasibility constraints that depend jointly on capacity, delay, and perceptual continuity requirements; the resulting operating set is typically a bounded perception-capacity band rather than a one-sided threshold. We outline the protocol and architectural implications (state identifiers, anchors, bounded rollback, and patch-based updates) and provide a stylized illustrative example to visualize the induced feasibility region and its dependence on predictive quality.
format Preprint
id arxiv_https___arxiv_org_abs_2602_10542
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Predictive-State Communication: Innovation Coding and Reconciliation under Delay
Ercetin, Ozgur
Chraiti, Mohaned
Information Theory
Machine Learning
Networking and Internet Architecture
Shannon theory models communication as the reliable transfer of symbol sequences, with performance governed by capacity and rate-distortion limits. When both endpoints possess strong predictors -- as in modern large language models and related generative priors -- literal symbol transport is no longer the only operational regime. We propose predictive-state communication (PSC), in which the transmitter and receiver maintain an explicit shared predictive state, and the physical channel is used primarily to convey innovations, i.e., corrective information that reconciles the receiver's provisional trajectory with the transmitter's realized trajectory. This viewpoint replaces entropy-rate accounting by cross-entropy accounting under model mismatch, and it introduces feasibility constraints that depend jointly on capacity, delay, and perceptual continuity requirements; the resulting operating set is typically a bounded perception-capacity band rather than a one-sided threshold. We outline the protocol and architectural implications (state identifiers, anchors, bounded rollback, and patch-based updates) and provide a stylized illustrative example to visualize the induced feasibility region and its dependence on predictive quality.
title Predictive-State Communication: Innovation Coding and Reconciliation under Delay
topic Information Theory
Machine Learning
Networking and Internet Architecture
url https://arxiv.org/abs/2602.10542