CORTEXA
← Browse
arxivcs.ITeess.SP2026-06-28

SoftBinary Coding: A New Information-Theoretic Neural Compression Paradigm

Ezgi Ozyilkan, Sharang M. Sriramu, Elza Erkip, Aaron B. Wagner, Jona Ballé

Neural compression is currently dominated by Nonlinear Transform Coding (NTC), which maps data to real-valued latents via continuous transforms. Despite its success, NTC suffers from train-test mismatch due to non-differentiable quantization, a ``smoothness bias" inherent in continuous transforms that precludes optimality for certain sources, and a loss of ``shaping gain" due to the complexity of including high-dimensional vector quantization. We propose SoftBinary Coding (SBC), an end-to-end learning paradigm that bypasses these limitations by using a stochastic binary latent space. In the spirit of vector quantization, SBC employs discrete representations and compresses them through a novel fast binary channel simulation scheme, for which we provide a proof of rate optimality. Experimental gains on information-theoretic sources provide both theoretical and practical closure to NTC's limitations, establishing discrete binary structures as a viable path toward reaching optimal rate--distortion bounds. Surprisingly, SBC also achieves state-of-the-art performance on vector quantization of i.i.d. sources, exceeding Trellis Coded Quantization of the Gaussian source.

View free PDFSource page

Related papers

arxivcs.ITcs.AIeess.SP2026-06-26

Contrastive Predictive Coding with Compression for Enhanced Channel State Feedback in Wireless Networks

Ahmed Y. Radwan, Fahad Syed Muhammad, Matthew Baker, Hina Tabassum

Accurate and timely channel state information (CSI) is essential for next-generation wireless systems, yet existing works treat CSI compression and CSI prediction as separate problems, both in academia and in current 3GPP studies. Consequently, channel aging remains insufficientl…

View free PDFSource page
arxivcs.ITeess.SP2026-07-16

Lossy compression of weighted graph adjacency matrices by transform coding

Kenta Yanagiya, Junya Hara, Hiroshi Higashi, Yuichi Tanaka, Antonio Ortega

In this paper, we propose a compression framework for weighted graphs in which the graph topology is transmitted losslessly and edge weights are compressed lossily. A challenge in the lossy compression of edge weights is that the underlying relationships between edges are ambiguo…

View free PDFSource page
arxivcs.NIcs.CRcs.ITcs.LGeess.SP2026-06-30

Semantic Leakage and Privacy Preservation in Relay-Assisted Semantic Communications

Yalin E. Sagduyu, Tugba Erpek, Aylin Yener, Sennur Ulukus

Semantic communication (SemCom) has emerged as a promising paradigm in which the transmission of task-relevant information is prioritized over raw data, enabling efficient and robust communication under resource and channel constraints. In this paper, the privacy implications of…

View free PDFSource page
arxivcs.ITcs.GTeess.SP2026-07-20

Compositional Semantic Communication for Physical AI: Category Theory Meets Game Theory

Christo Kurisummoottil Thomas, Walid Saad, Emilio Calvanese Strinati

Physical artificial intelligence (AI) systems involve distributed sensing agents with embedded AI models that must coordinate to perceive, reason, and act in networked environments. Transmitting raw sensor data incurs significant communication overhead, latency, and redundancy. W…

View free PDFSource page
arxivcs.ITcs.DCcs.LGeess.SP2026-07-14

Mixed-Timescale Differential Coding for Downlink Model Broadcast in Wireless Federated Learning

Chung-Hsuan Hu, Zheng Chen, Erik G. Larsson

In standard federated learning systems, the parameter server broadcasts the global model to the participating devices in every iteration. Motivated by the temporal correlation between consecutive global models, differential coding can be applied to global model dissemination to r…

View free PDFSource page