English
Related papers

Related papers: On the R\'enyi Rate-Distortion-Perception Function…

200 papers

Transformers achieve superior performance on many tasks, but impose heavy compute and memory requirements during inference. This inference can be made more efficient by partitioning the process across multiple devices, which, in turn,…

Machine Learning · Computer Science 2026-04-21 Anderson de Andrade , Alon Harell , Ivan V. Bajić

We present a novel systematic theoretical framework to analyze the rate-distortion (R-D) limits of learned image compression. While recent neural codecs have achieved remarkable empirical results, their distance from the…

Information Theory · Computer Science 2026-01-15 Changshuo Wang , Zijian Liang , Kai Niu , Ping Zhang

We show that the R\'enyi entropies of single particle, extended wave functions for disordered systems contain information about the multifractal spectrum. It is shown for moments of the R\'enyi entropy, $S_{n}$, where $|n|<1$, it is…

Mesoscale and Nanoscale Physics · Physics 2013-02-04 Xiao Chen , Benjamin Hsu , Taylor L. Hughes , Eduardo Fradkin

This dissertation investigates relative entropies, also called generalized divergences, and how they can be used to characterize information-theoretic tasks in quantum information theory. The main goal is to further refine characterizations…

Quantum Physics · Physics 2016-11-29 Felix Leditzky

This paper studies the rate-distortion-perception (RDP) tradeoff for a Gaussian vector source coding problem where the goal is to compress the multi-component source subject to distortion and perception constraints. Specifically, the RDP…

Information Theory · Computer Science 2025-03-18 Jingjing Qian , Sadaf Salehkalaibar , Jun Chen , Ashish Khisti , Wei Yu , Wuxian Shi , Yiqun Ge , Wen Tong

We consider the maximum entropy problems associated with R\'enyi $Q$-entropy, subject to two kinds of constraints on expected values. The constraints considered are a constraint on the standard expectation, and a constraint on the…

Information Theory · Computer Science 2008-12-18 Jean-François Bercher

Channel simulation is to simulate a noisy channel using noiseless channels with unlimited shared randomness. This can be interpreted as the reverse problem to Shannon's noisy coding theorem. In contrast to previous works, our approach…

Information Theory · Computer Science 2025-06-06 Shi-Bing Li , Ke Li , Lei Yu

Consider the problem of estimating a latent signal from a lossy compressed version of the data when the compressor is agnostic to the relation between the signal and the data. This situation arises in a host of modern applications when data…

Information Theory · Computer Science 2021-01-12 Alon Kipnis , Stefano Rini , Andrea J. Goldsmith

This work explores properties of Strong Data-Processing constants for R\'enyi Divergences. Parallels are made with the well-studied $\varphi$-Divergences, and it is shown that the order $\alpha$ of R\'enyi Divergences dictates whether…

Information Theory · Computer Science 2026-01-15 Adrien Vandenbroucque , Amedeo Roberto Esposito , Michael Gastpar

We apply statistical mechanics to an inverse problem of linear mapping to investigate the physics of the irreversible compression. We use the replica symmetry breaking (RSB) technique with a toy model to demonstrate the Shannon's result.…

Disordered Systems and Neural Networks · Physics 2009-11-07 Tatsuto Murayama , Masato Okada

Generalization to novel visual conditions remains a central challenge for both human and machine vision, yet standard robustness metrics offer limited insight into how systems trade accuracy for robustness. We introduce a…

Machine Learning · Computer Science 2026-03-03 Leyla Roksan Caglar , Pedro A. M. Mediano , Baihan Lin

We revisit the Gray-Wyner lossy source coding problem and derive the first-order asymptotic optimal rate-distortion-perception region when additional perception constraints are imposed on reproduced source sequences. The optimal trade-off…

Information Theory · Computer Science 2026-01-19 Yu Yang , Yingxin Zhang , Weijie Yuan , Lin Zhou

In this paper, we study the computation of the rate-distortion-perception function (RDPF) for a multivariate Gaussian source under mean squared error (MSE) distortion and, respectively, Kullback-Leibler divergence, geometric Jensen-Shannon…

Information Theory · Computer Science 2023-11-16 Giuseppe Serra , Photios A. Stavrou , Marios Kountouris

Strong data processing inequalities (SDPI) are an important object of study in Information Theory and have been well studied for $f$-divergences. Universal upper and lower bounds have been provided along with several applications,…

Information Theory · Computer Science 2024-05-16 Lifu Jin , Amedeo Roberto Esposito , Michael Gastpar

We derive a new variational formula for the R\'enyi family of divergences, $R_\alpha(Q\|P)$, between probability measures $Q$ and $P$. Our result generalizes the classical Donsker-Varadhan variational formula for the Kullback-Leibler…

Machine Learning · Statistics 2021-07-21 Jeremiah Birrell , Paul Dupuis , Markos A. Katsoulakis , Luc Rey-Bellet , Jie Wang

We introduce a set of useful expressions of Differential Privacy (DP) notions in terms of the Laplace transform of the privacy loss distribution. Its bare form expression appears in several related works on analyzing DP, either as an…

Machine Learning · Computer Science 2024-11-15 Rishav Chourasia , Uzair Javaid , Biplap Sikdar

Properties of scalar quantization with $r$th power distortion and constrained R\'enyi entropy of order $\alpha\in (0,1)$ are investigated. For an asymptotically (high-rate) optimal sequence of quantizers, the contribution to the R\'enyi…

Information Theory · Computer Science 2012-03-27 Wolfgang Kreitmeier , Tamas Linder

We consider optimal scalar quantization with $r$th power distortion and constrained R\'enyi entropy of order $\alpha$. For sources with an absolutely continuous distribution the high rate asymptotics of the quantizer distortion has long…

Information Theory · Computer Science 2011-07-06 Wolfgang Kreitmeier , Tamas Linder

We consider the problem of distributed lossy linear function computation in a tree network. We examine two cases: (i) data aggregation (only one sink node computes) and (ii) consensus (all nodes compute the same function). By quantifying…

Information Theory · Computer Science 2017-01-16 Yaoqing Yang , Pulkit Grover , Soummya Kar

A receiver wants to compute a function of two correlated sources separately observed by two transmitters. One of the transmitters may send a possibly private message to the other transmitter in a cooperation phase before both transmitters…

Information Theory · Computer Science 2015-04-08 Milad Sefidgaran , Aslan Tchamkerten