跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.20279 · v1

Functional Information, Optimal Channel Simulation and Lossy Source Coding

首次提交 2026-11-16 06:18
版本更新 2026-11-16 06:18
雷达观测 2026-11-17 17:12
arXiv ↗PDF ↗

摘要

We characterize, within a constant number of bits, the minimum achievable rate for several one-shot coding problems, such as channel simulation and lossy source coding. The basis of our work is a new information measure between random variables X,YX, Y that we call the functional information IF(X→Y)I_F(X \to Y). We show that this quantity characterizes the minimum one-shot rate R∗(X→Y)R^*(X \to Y) of channel simulation, in which a sample Y∼PY∣XY \sim P_{Y \mid X} is communicated in the presence of common randomness: IF(X→Y)≤R∗(X→Y)<IF(X→Y)+1.45I_F(X \to Y) \leq R^*(X \to Y) < I_F(X \to Y) + 1.45. For the achievability result, we construct an explicit code using the Poisson functional representation. Using these results, we develop new bounds for one-shot variable-rate lossy source coding: given some distortion measure ΔΔ, we use IF(X→Y)I_F(X \to Y) to define the functional rate-distortion function RFR_F. Then, letting ROR_O denote the one-shot operational rate-distortion function with private encoder randomness and distortion measure ΔΔ, we make use of our channel simulation result to show that RF(D)≤RO(D)<RF(D)+2.45R_F(D) \leq R_O(D) < R_F(D) + 2.45 at every positive distortion level DD. Finally, we generalize our channel simulation result by introducing the Rényi αα-functional information IF,α(X→Y)I_{F, α}(X \to Y) and show that it characterizes the minimum Arimoto-Rényi conditional entropy for channel simulation, Rα∗(X→Y){R^*_α(X \to Y)}, associated with the Campbell cost: IF,α(X→Y)≤Rα∗(X→Y)≤IF,α(X→Y)+O(1/α){I_{F, α}(X \to Y) \leq R^*_α(X \to Y) \leq I_{F, α}(X \to Y) + O(1/α)}.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-16 06:18 · 最新观测版本

Functional Information, Optimal Channel Simulation and Lossy Source Coding

We characterize, within a constant number of bits, the minimum achievable rate for several one-shot coding problems, such as channel simulation and lossy source coding. The basis of our work is a new information measure between random variables X,YX, Y that we call the functional information IF(X→Y)I_F(X \to Y). We show that this quantity characterizes the minimum one-shot rate R∗(X→Y)R^*(X \to Y) of channel simulation, in which a sample Y∼PY∣XY \sim P_{Y \mid X} is communicated in the presence of common randomness: IF(X→Y)≤R∗(X→Y)<IF(X→Y)+1.45I_F(X \to Y) \leq R^*(X \to Y) < I_F(X \to Y) + 1.45. For the achievability result, we construct an explicit code using the Poisson functional representation. Using these results, we develop new bounds for one-shot variable-rate lossy source coding: given some distortion measure ΔΔ, we use IF(X→Y)I_F(X \to Y) to define the functional rate-distortion function RFR_F. Then, letting ROR_O denote the one-shot operational rate-distortion function with private encoder randomness and distortion measure ΔΔ, we make use of our channel simulation result to show that RF(D)≤RO(D)<RF(D)+2.45R_F(D) \leq R_O(D) < R_F(D) + 2.45 at every positive distortion level DD. Finally, we generalize our channel simulation result by introducing the Rényi αα-functional information IF,α(X→Y)I_{F, α}(X \to Y) and show that it characterizes the minimum Arimoto-Rényi conditional entropy for channel simulation, Rα∗(X→Y){R^*_α(X \to Y)}, associated with the Campbell cost: IF,α(X→Y)≤Rα∗(X→Y)≤IF,α(X→Y)+O(1/α){I_{F, α}(X \to Y) \leq R^*_α(X \to Y) \leq I_{F, α}(X \to Y) + O(1/α)}.

查看此版本解读 →查看此版本原文 ↗