跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+86新增论文
+61其中 AI 相关
+14已有论文修订
+93新增 AI 导读

arXiv 最近完成扫描:2026-11-16 01:34 · 全站最近入库:2026-11-16 10:40各信源进度 →

统计口径与数据新鲜度

统计 2026-11-15 11:33 — 2026-11-16 11:33(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-16 10:40库内论文最新更新时间:2026-11-13 16:48

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

23,434 已收录论文19,641 AI 相关6,765 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
新论文 · v1arXiv:2610.34697

Semantic Transferability of Generative Rate-Distortion-Perception Systems

Jinwan Jeon, Seoyeon Hwang, Sung Hoon Lim

原文摘要

Generative lossy compression combines a rate-limited representation with a stochastic decoder that preserves source-dependent information while generating unresolved detail. We ask what remains reusable when a rate-distortion-perception (RDP) system selected for one operating point is transferred to a prescribed conditional-generation task. We distinguish the single-letter RDP factorization from its block-code implementation and compare Full Redesign with three increasingly restrictive transfer strategies. Renderer-Only Transfer retains only the renderer and redesigns semantic steering. Representation-Induced Transfer additionally retains the semantic latent law induced by the original representation. Full-Model Transfer retains a compatible RDP code, marginalizing over the task conditional law to form its semantic encoder. For finite alphabets, we characterize Renderer-Only Transfer's exact compression-common-randomness rate region, renderer-hull controllability condition, and compression-rate penalty relative to Full Redesign. Under unlimited common randomness, this penalty is the minimum residual semantic information $I(S;U|X)$ forced by the inherited renderer. Representation-Induced Transfer is exact if and only if the semantic condition depends on the source only through the recurrent-class label $C$ of the end-to-end RDP test channel. Every compatible RDP code reused under Full-Model Transfer preserves $C$ and supports every task satisfying $X-C-S$. Any additionally transferable within-class semantic dependence must satisfy $I(S;X|C)\le R_0-H(C)$, where $R_0$ is the inherited compression rate. The bound is exact when $R_0=H(C)$. A scalar Gaussian specialization yields a renderer-noise controllability threshold, a closed-form transfer penalty, and examples of identical Gaussian RDP test channels with different Renderer-Only Transfer capabilities.

cs.IT