arXiv:2605.09833cs.ITcs.LG2026-05

用最小熵耦合实现跨域有损压缩,兼顾分类任务与重建质量。

Cross-Domain Lossy Compression via Constrained Minimum Entropy Coupling

论文配图:Cross-Domain Lossy Compression via Constrained Minimum Entropy Coupling
图 1 · 摘自论文原文
  • 基于最小熵耦合构建信息约束的压缩框架,强化源与重构间关联。
  • 在MNIST超分辨率和SVHN去噪任务中,率增可提升分类准确率与重建信息量。
  • 适用于需保留下游任务信息的跨域图像压缩场景。

本文从最小熵耦合(MEC)视角研究带率与分类约束的跨域有损压缩问题。编码器观测退化源域样本,解码器需生成符合目标分布且保留下游分类相关信息的输出。受对数损失畸变启发,采用最大化源与重构间耦合强度的信息目标,而非最小化样本级畸变。在公共随机性假设下,提出率约束的MEC问题(MEC-B),证明中间表示可被移除而不损失最优性,得到等价确定性耦合形式。针对伯努利源,推导出含与不含分类约束的闭式解。此外,设计基于量化、熵建模、分布匹配与分类正则化的神经恢复框架。在MNIST超分辨率与SVHN去噪实验中,增加可用率可提升分类准确率并生成更富含信息的重建结果。

原文摘要 · Abstract (English)

This paper studies cross-domain lossy compression through the lens of minimum entropy coupling (MEC) with rate and classification constraints. In this setting, an encoder observes samples from a degraded source domain, while the decoder is required to generate outputs following a prescribed target distribution and to preserve information relevant to a downstream classification task. Motivated by logarithmic-loss distortion, we adopt an information-based objective that maximizes the coupling strength between the source and reconstruction, rather than minimizing a sample-wise distortion. Under common randomness, we formulate a rate-constrained MEC problem (MEC-B) and show that the intermediate representation can be removed without loss of optimality, yielding an equivalent deterministic coupling formulation. For Bernoulli sources, closed-form expressions are derived with and without classification constraints. In addition, we implement a neural restoration framework using quantization, entropy modeling, distribution matching, and classification regularization. Experiments on MNIST super-resolution and SVHN denoising show that increasing the available rate improves classification accuracy and yields more informative reconstructions.

压缩最小熵跨域分类保持

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。