Abstract:A proposition that connects randomness and compression is put forward via Gibbs entropy over set of measurement vectors associated with a compression process. In building this connection, we use a performance of a learning task as a probe of compression, over series of compression cycles within a cascade. The Gibbs entropy at each cycle measures the degree of randomness. Consequently a lossy compression process can be seen as an equivalent to {\it directed randomness} that preserves information content under certain bounds of Gibbs entropy and the performance of the learning task. The term directed means we guide the compression process with set of mathematical rules on how to reduce the model size. We formulate this connection with a theorem using a $\delta$ and $\epsilon$ bounds, and demonstrated a logical proof via comonotonic relationship within a very small decrease in compression ratio and the performance. We have showcase the validity of this proposition with a canonical vision task in deep learning with three different model compression processes as {\it a baseline model}. We use the following, simpler to more complex model compression approaches: (1) random pruning, (2) magnitude pruning, and (3) a more complex compression by using dual tomographic compression, which utilizes compressed sensing in dual fashion. We use remaining weights of deep learning network as a measurement vector where we measure the Gibbs entropy. The proposition is supported with the experimental evidence, resulting in very high correlation between learning performance and the Gibbs entropy over compression ratios for all different compression processes. We show case the idea that there is an inherent computable connection between compression probed by performance degradation and randomness from an entropy measure on the learned model.
From: Mehmet A. Süzen PhD [view email]
[v1]
Thu, 29 May 2025 10:48:35 UTC (367 KB)
[v2]
Mon, 30 Jun 2025 12:42:09 UTC (438 KB)
[v3]
Mon, 5 Jan 2026 14:07:39 UTC (374 KB)
[v4]
Thu, 16 Jul 2026 14:26:46 UTC (478 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。