- Rating
- 4
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper systematically investigates the task-aware compression problem with the reconstruction and classification constraints (i.e., a statistical test). The paper shows the coding theorem for the rate-distortion-error function. The proposed problem is also studied at various levels of available domain information (individual source hypotheses and the classifier's decision regions at the receiver side). An interesting result is that minimizing the distance between the target distribution of the statistical test and the source distribution enhances classification accuracy, with an explicit bound derived. The theoretical claims are supported by numerical experiments
Critical strengths
The quality of the paper is good. The paper presents a clear and well-structured theoretical analysis by showing a new coding theorem of the rate-distortion-error function and deriving the closed-form function for the Bernoulli case.
The probability of error bounds for a known test distribution with the distribution matching to improve the classification accuracy are interesting and insightful. The proposed problem is also studied at various levels of available domain information, including individual source hypotheses and the classifier's decision regions at the receiver side.
The numerical results and empirical validation are convincing. The paper is well written, with a clear and well-organized presentation.
Critical weaknesses
In the related work section, the comparison with the perception constraint in previous works (Liu et al., 2022; Nguyen et al., 2026) is a mismatch. This paper minimizes the distance between reconstruction probability and the target probability, while the previous paper minimizes the distance between reconstruction probability and the source probability, aiming to improve the perception quality.
The role of the shared common randomness is not explained clearly in the framework in the main paper. It helps show the coding theorem by applying the Strong Functional Representation Lemma.
The mathematical derivations are rigorous, though additional intuition would make them more accessible to the machine learning audience.
Questions for authors
The paper should benefit from studying the closed-form solution of the rate-distortion-error function for a Gaussian source.
The proposed problem is in the one-shot setting. Could the authors give some insight about the asymptotic setting? It should be a good extension.
I am wondering whether more results for the rate-distortion-error problems in (10) and (11) can be derived, such as the closed-form solutions for Bernoulli and Gaussian sources.
3 comments
I thank the authors for their detailed clarifications, which I found convincing, particularly their explanation of the formula’s intuition. I was mistaken about Question 2 in the asymptotic setting, and I appreciate the authors’ correction. After reviewing their responses to the other reviewers as well, I will maintain my positive evaluation and current score.
We sincerely thank reviewer m8vk for their helpful suggestions and their positive assessment of our work. We greatly appreciate your time and effort put into reviewing our paper.
Reply to Reviewer m8vk
We thank the reviewer for the very positive assessment and for suggestions that improve the presentation. All changes described below will appear in the revised PDF, which we will upload by November 15.
W1: Related work. We agree that the paragraph was unclear and have rewritten it. Most rate–distortion–perception works we cite (e.g. Theis & Wagner, 2021; Wagner; Hamdi et al., 2026) match the reconstruction to the exact source distribution, as the reviewer states, to improve the perceptual quality of the reconstruction. The works of Liu et al. (2022) and Nguyen et al. (2026) are slightly different. While they enforce the perception constraint to improve the perceptual quality, the distribution to which they match is not exactly the source distribution (in Liu et al., they match to a clean distribution of which the source is a degraded version). We share the target-matching aspect with them. The difference is where the target comes from and why it is matched: in our setting the target is class-conditional, set by the distribution the receiver's classifier was trained on, and the matching constraint follows from the classification constraint rather than being imposed for perceptual quality. The revised paragraph separates the two lines of work in this way.
W2: Common randomness. We added a paragraph after Def. 1. For R(D,α) alone, deterministic coding schemes would be sufficient and would not require common randomness. We use common randomness to simplify our achievability proofs, and these same coding schemes can be used when perception constraints are involved, as in (7), (10) and (11). We have now outlined the main steps of the coding scheme in the appendix.
Intuition. We added two short explanations for readers outside information theory. After (5), we explain the two parts of the optimal rate:
achieves pe∗smallest rate thatR(D)=own decision Jconveys the transmitter’sH(J)+within each decision regionreconstructs the sourceR′(D)
To reach the best possible error, a code must at least convey the transmitter's own decision J, which costs H(J) bits; the remaining rate R′(D), defined in (6), is spent on reconstructing the source within each decision region. After Thm. 1, we explain the three terms of the error bound:
pe(X^)≤own errortransmitter’spe∗+on its own domainreceiver’s errorCre+are from class i in the receiver’s domainhow far the reconstructions of class ii=0∑M−1Pi∥PX^i−ri∥TV
That is, the error splits into three parts, namely the transmitter's own error, the receiver's error on its own domain, and how far each class's reconstructions are from that class in the receiver's domain. Only the last depends on the codec, which is why matching onto ri lowers the error.
Q1: Gaussian sources. This is an interesting suggestion that would shed some light on the behavior of the RDE formulation in the continuous domain. We hope to explore this in the future and to compare the solution of the RDE problem formally with that of our RDP formulation in (10).
Q2: the asymptotic setting. The RDE formulation is derived from the achievability definition given by (1), which is in the asymptotic setting. In Proposition 1, using the Strong Functional Representation Lemma, we show that the rate defined by (2) is the asymptotic rate of the problem.
Q3: closed forms for (10) and (11). Solving (10) and (11) with Gaussian priors is a useful and interesting extension. However, this would also require solving an RDP problem for Gaussian mixtures, which might be challenging. We have added this interesting extension as future work. The formulation with Bernoulli priors is quite possible, but it may result in degenerate formulations or trivial solutions since ∣X∣=2.
We thank the reviewer again for the support and the suggestions.