Computation of the optimal error exponent function for fixed-length lossy source coding in discrete memoryless sources

2023/12/06 by Jitsumatsu, Yutaka
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.2312.03784

Abstract

Marton's optimal error exponent for the lossy source coding problem is defined as a non-convex optimization problem. This fact had prevented us to develop an efficient algorithm to compute it. This problem is caused by the fact that the rate-distortion function R(Δ|P) is potentially non-concave in the probability distribution P for a fixed distortion level Δ. The main contribution of this paper is the development of a parametric expression that is in perfect agreement with the inverse function of the Marton exponent. This representation has two layers. The inner layer is convex optimization and can be computed efficiently. The outer layer, on the other hand, is a non-convex optimization with respect to two parameters. We give a method for computing the Marton exponent based on this representation.

Related

• Computing the optimal error exponential function for fixed-length lossy coding in discrete memoryless sources
• Efficient Computation of Marton's Error Exponent via Constraint Decoupling
• An Iterative Algorithm for Computing the Optimal Exponent of Correct Decoding Probability for Rates below the Rate Distortion Function
• Algorithm Families for Computing Information-Theoretic Forms of Strong Converse Exponents in Channel Coding and Lossy Source Coding
• Exponent Function for Source Coding with Side Information at the Decoder at Rates below the Rate Distortion Function