A Convergent Primal-Dual Algorithm for Computing Rate-Distortion-Perception Functions
Chunhui Chen, Linyi Chen, Xueyan Niu, Hao Wu

TL;DR
This paper introduces a convergent primal-dual algorithm for computing Rate-Distortion-Perception functions, providing theoretical guarantees and empirical efficiency for balancing compression, quality, and perceptual fidelity.
Contribution
It presents a new theoretical framework and a primal-dual algorithm with proven convergence for RDP functions, addressing previous computational and theoretical limitations.
Findings
Proves an $O(1/n)$ convergence rate for the algorithm.
Achieves competitive empirical performance in RDP computation.
Bridges a theoretical gap in RDP optimization literature.
Abstract
Recent advances in Rate-Distortion-Perception (RDP) theory highlight the importance of balancing compression level, reconstruction quality, and perceptual fidelity. While previous work has explored numerical approaches to approximate the information RDP function, the lack of theoretical guarantees remains a major limitation, especially in the presence of complex perceptual constraints that introduce non-convexity and computational intractability. Inspired by our previous constrained Blahut-Arimoto algorithm for solving the rate-distortion function, in this paper, we present a new theoretical framework for computing the information RDP function by relaxing the constraint on the reconstruction distribution and replacing it with an alternative optimization approach over the reconstruction distribution itself. This reformulation significantly simplifies the optimization and enables a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
