Search arXiv⌕ Search

arXiv · 2609.38159

An information identity reveals the geometry of deviation events

Abstract

In a deviation event, the empirical measure of $n$ independent draws lands in a set of distributions. The exponent of its probability splits, at every $n$, into two nonnegative terms. The first is the rate: $n$ times the relative entropy, from the population, of the distribution of a typical draw under the event. The second is the dependence that conditioning induces among the draws, measured by their total correlation. Their relative sizes depend on the geometry of the set. This paper focuses on this exact split and on the geometry that the interplay of its two terms reveals. The dependence vanishes exactly when the event confines every draw to a single set, and the classical rate of that constraint is exact. On a set invariant under a compact group that fixes the population and leaves no invariant set of intermediate probability, the rate vanishes; uniform convergence over a hypothesis class that such a group permutes is one. On a half-space whose threshold sits a fixed number of standard errors above the mean, the fraction of the exponent that is dependence tends to a function of the event's probability alone. On a set split into pieces, the dependence is the pieces' average plus $n$ times the Jensen-Shannon divergence of their marginals, minus the entropy of their weights. The split extends to a general reference law. When the information projection is such a law, the split gives the exact value of the expectation in the exponential change of measure to the projection.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Akshay Balsubramani. 2026-09-29. An information identity reveals the geometry of deviation events. https://arxiv.org/abs/2609.38159

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rate Loss Analysis for Multiple-Antenna NOMA with Limited Feedback

In the limited feedback downlink multiple-input single-output (MISO) non-orthogonal multiple access (NOMA) system, both the effective channel gain and the channel direction need to be quantized. The quantization error affects the feasible region of NOMA and the rate loss compared with the case of full channel state information (CSI). In this work, we analyze these effects and obtain an upper bound for the rate loss. Numerical results show that the sum rate of the limited feedback MISO-NOMA system approaches that of the full CSI as the number of feedback bits increases.

cs.IT↗

Robust Rate-Splitting Design for Mixed Dual-Polarized Integrated Satellite-Terrestrial Networks Under Polarization Mismatch

Dual-polarized transmission offers a promising approach to improve spectral efficiency in multiantenna networks by reusing frequency and time resources across orthogonal polarization domains. Building upon this advantage, this paper investigates interference management in mixed dual-polarized integrated satellite-terrestrial networks (MDP-ISTN), comprising a circularly polarized (CP) satellite sub-network and a linearly polarized (LP) terrestrial sub-network. To this end, we employ rate-splitting multiple access (RSMA), which enables flexible non-orthogonal transmission through partial interference decoding and partial interference treating-as-noise. Specifically, to jointly mitigate both inter-network interference between the CP low Earth orbit (LEO) satellite and LP terrestrial sub-networks as well as intra-network interference within each sub-network, we propose an MDP-RSMA framework that incorporates inter-network rate-splitting (RS) with a super-common message together with intra-network RS. Moreover, we account for practical challenges in MDP-ISTN, including polarization mismatch, channel depolarization, and imperfect channel state information at the transmitter. To maximize the minimum user rate among all satellite and terrestrial users, we formulate a robust precoder optimization problem and develop a weighted minimum mean square error (WMMSE)-based algorithm tailored to the proposed MDP-RSMA. Numerical results demonstrate that the proposed scheme significantly improves the minimum user rate over several baseline schemes across diverse MDP-ISTN scenarios.

cs.IT↗

Channel Knowledge Empowered Finite-Blocklength Rate-Splitting Transmission for High-Mobility Autonomous Driving

To meet the extended ultra-low latency and high reliability (xURLLC) requirements for autonomous driving sys-tems, multiple access schemes must operate reliably in high-mobility and complex propagation environments. Recently, rate-splitting multiple access (RSMA) has emerged as a promis-ing multi-user transmission framework, showing robustness in dynamic situations where imperfect and outdated channel state information (CSI) is prevalent. Moreover, the advanced sensing, localization, and on-board computation capabilities of autonomous driving vehicles facilitate the construction of a channel knowledge map (CKM), which is a key enabler for environment-aware communications in future 6G networks. In this work, we propose a CKM-aware finite-blocklength (FBL) RSMA for a downlink autonomous driving system. The location-dependent large-scale channel information provided by CKM is exploited to guide the common/private power split and common-rate allocation in RSMA. Specifically, we derive a new and tight closed-form bound for the private-stream ergodic rate. Combined with the closed-form expression for the common-stream ergodic rate, an optimization design of splitting ratios is formulated to maximize the min-rate performance among multiple users. Numerical results show that the proposed scheme outperforms the considered space-division multiple access (SDMA) and non-orthogonal multiple access (NOMA) schemes in high-mobility scenarios. Comparisons across different CKMs further highlight the benefit of accurate channel information, demonstrating how environment-aware channel knowledge complements flexible in-terference management of RSMA in high-mobility short-packet communications.

cs.IT↗