Computation of the optimal error exponent function for fixed-length lossy source coding in discrete memoryless sources (2312.03784v2)
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(\Delta|P)$ is potentially non-concave in the probability distribution $P$ for a fixed distortion level $\Delta$. 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.
- R. Ahlswede, “External properties of rate-distortion functions,” IEEE Trans. Inform. Theory, vol. 36, no. 1, pp. 166–171, 1990.
- D. R. Marton, “Error exponent for source coding with a fidelity criterion,” IEEE Trans. Inform. Theory, vol. 20, pp. 197–199, 1974.
- R. Blahut, “Computation of channel capacity and rate distortion functions,” IEEE Trans. Inform. Theory, vol. 18, pp. 460–473, 1972.
- S. Arimoto, “An algorithm for calculating the capacity of an arbitrary discrete memoryless channel,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 14–20, 1972.
- ——, “Computation of random coding exponent functions,” IEEE Trans. Inform. Theory, vol. IT-22, no. 6, pp. 665–671, 1976.
- R. Blahut, “Hypothesis testing and information theory,” IEEE Trans. Inform. Theory, vol. 20, pp. 405 – 417, 1974.
- E. Arıkan and N. Merhav, “Guessing subject to distortion,” IEEE Trans. Inform. Theory, vol. 44, no. 3, pp. 1041–1056, 1998.
- E. Haroutunian and B. Mekoush, “Estimates of optimal rates of codes with given error probability exponent for certain sources,” in 6th Int. Symp. on Information Theory (in Russian), vol. 1, 1984, pp. 22–23.
- A. N. Harutyunyan and E. A. Haroutunian, “On properties of rate-reliability-distortion functions,” IEEE Trans. Information Theory, vol. 50, no. 11, pp. 2768–2773, 2004.
- V. Kostina and S. Verdú, “Fixed-length lossy compression in the finite blocklength regime,” IEEE Transactions on Information Theory, vol. 58, no. 6, pp. 3309–3338, 2012.
- M. Sion, “On general minimax theorems,” Pacific J. Math, vol. 8, no. 1, pp. 171–176, 1958.
- E. A. Haroutunian, A. N. Harutyunyan, and A. R. Ghazaryan, “On rate-reliability-distortion function for a robust descriptions system,” IEEE Trans. Information Theory, vol. 46, no. 7, pp. 2690–2697, 2000.
- H. Palaiyanur and A. Sahai, “On the uniform continuity of the rate-distortion function,” in 2008 IEEE Int. Symp. Inform. Theory. IEEE, 2008, pp. 857–861.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.