-
The paper claims to occupy a "missing operating point" for practical image compression, but it does not state the deployment scenario, and the comparison set omits the codecs that would compete in either plausible scenario. If the scenario is delivery (encode once, decode many times on client CPUs), the relevant competitors are production decoders such as libjpeg-turbo, libwebp, libjxl for JPEG XL [e], dav1d for AVIF, and optimized VVC decoders [a]. HM-16.25 and VTM-17.0 are reference implementations, and their decoding times (98 ms and 189 ms) do not represent deployed decoders. VTM is −23.4% relative to HM on the same set, so an optimized VVC decoder at comparable single-thread speed would dominate PULSE in rate–distortion; the paper needs to measure this. In the delivery scenario, encoding cost is amortized, so overfitted codecs such as Cool-Chic and C3, which the introduction acknowledges reach receivers below 5 kMAC/pixel, belong in the left panel of Figure 1 with measured decoding times. The paper excludes them for their per-image encoding optimization and states that their sequential entropy models limit implementation efficiency (Section 7), but it does not measure that limitation. C3 matches VTM on CLIC2020 with fewer than 3 kMAC/pixel, and a reduced-complexity Cool-Chic decodes Kodak images (0.39 megapixels) on one CPU core in 100–268 ms at rate–distortion between HEVC and VVC [b]. Whether PULSE's speed at 1080p outweighs that rate–distortion gap is the comparison the paper's claim requires. If the scenario is capture on a device, the sender (45.35 kMAC/pixel) is the constraint. The paper reports 42 ms per 1080p encode on the Snapdragon 8 Elite NPU, but 920 ms on one CPU thread and 302 ms on the laptop CPU, so encoding at capture rates depends on an NPU; the relevant comparisons are then the hardware HEIC and JPEG encoders that phones capture with and asymmetric codecs with lightweight encoders [c, d]. In either case, the claim that PULSE-S is "faster than all compared codecs" depends on which codecs are compared. The only non-reference classical baseline, HEIC, is encoded in 4:2:0, while HM and VTM use 4:4:4, and the timing boundaries differ: HM and VTM timings use the native YUV interface and exclude RGB conversion, whereas the HEIC benchmark operates on in-memory RGB (Appendix C.1). The authors report that 4:4:4 was worse in their libheif/x265 setting (Appendix C.1). If PSNR is computed in RGB, as the RGB inputs suggest, this is unexpected at medium and high rates, and the 4:4:4 curve should be shown.
-
Agentic evolution is presented as a primary contribution, but the evidence is a single search trajectory without controls. Table 2 compares 22 training runs at −10.2% with hardware-aware NAS (attributed to Tatwawadi et al., 2026, in Section 6.2) at 1280 runs and −7.5%, yet the paper does not state whether the NAS was re-run by the authors, in which search space, with which training schedule per candidate, or under which complexity constraint. The agentic process also introduced new design dimensions (renderer resolution at E2, grouped convolution at E5, FFN width at E7), and the paper does not state whether the NAS search space contained them, so the comparison conflates the design of the search space with the search procedure. Each candidate is trained once, and the late promotions (E5→E6, −0.5 points; E6→E7, −1.3 points) are of the same order as seed-to-seed variation in learned codecs, which the paper does not report. The paper also does not state on which images candidates were selected. If the selection set is CLIC Professional validation, it is also the headline test set; PULSE's BD-rate relative to HM is most favorable there (−2.9%) among the five test sets (Kodak +1.2%, CLIC test +0.3%). The authors state that the human and LLM contributions cannot be separated (Section 4.4), and the LLM is identified only by name (gpt-5.6-sol, Appendix D.1), so the procedure cannot be reproduced or attributed. Supporting the sample-efficiency claim would require repeated independent runs, a NAS baseline in the same search space and budget, and ablations without the LLM and without the probes. Otherwise, the architecture should be presented as the contribution and the procedure as an account of how it was found.
-
The claim that PULSE (Perceptual) "competes with larger perceptual codecs like MS-ILLM" (Abstract) rests on metrics that disagree in sign across test sets and metrics. Relative to MS-ILLM, its FID BD-rate is −16.7% on Kodak, −4.1% on CLIC Professional validation, and −1.7% on DIV2K, but +12% on Tecnick, +17.8% on CLIC test, and +12.7% on the 300-image PICO subset (Tables 9 and 15), and its LPIPS-Alex BD-rate is worse by 25–32% on every set, while LPIPS-VGG, the larger term in its training loss, favors PULSE (Tables 12–13). With this disagreement, a human rating study, such as the one used to validate HiFiC, is needed to support the claim. The region-of-interest stage is motivated by text and face quality, but it is evaluated only with face and text PSNR (Table 8), and the paper does not state the evaluation images for Table 8 or the detector that produces the face and text regions. Section 5 states that the stage "jointly improves pixel fidelity, perceptual quality, and ROI quality, which is verified in Table 8", but in Table 8, removing the ROI losses improves LPIPS-VGG and FID BD-rate by 2.4% and 3.7%. Generative decoders can substitute characters or alter identity at low rates, so character error rate of a text recognizer and face verification accuracy on the decoded crops would test what the stage is designed to preserve.
-
The "bit-exact entropy coding across platforms" result (Figure 1, Table 3 caption, Section 8) covers less of the receiver than the placement of the "Two-step entropy model" inside the Entropy Coding block of Figure 2 suggests. By Equations (3) and (5), the rANS decoder uses only the CDF-table index computed from z^ by the integer projection, and Appendix A.3 states that entropy coding and linear CDF decoding run on the CPU of every device. The hyper decoder and the two entropy-model steps, which together account for 1.56 of the receiver's 5.21 kMAC/pixel (Table 4), do not participate in symbol decoding; they run afterward on the floating-point or NPU backend to produce the quantization step q and the means μ0 and μ1 that dequantize the decoded symbols. Table 6 therefore verifies agreement of the integer CPU path across three platforms, and says nothing about whether the reconstruction agrees. When a bitstream encoded on one device is decoded on another, a numerical difference in q or μ0 perturbs y^0, propagates through the second step into μ1 and y^1, and alters the reconstruction, and the paper does not report the pixel-level difference between decodes of the same bitstream on the three backends. The paper's wording is accurate where it says "entropy coding"; Figure 2 and the Section 1 description of the "compact entropy-control path" should make the boundary explicit, and the cross-device reconstruction difference should be measured.
-
The authors withhold the source code, the trained PULSE, PULSE-S, PULSE-L, and perceptual checkpoints, the INT8 linear-CDF weights and CDF tables, and the logs of the evolution rounds. There is no supplementary material and no anonymous repository link. The central claims depend on single-thread timings, which are sensitive to the inference runtime and rANS implementation, and on cross-device determinism, neither of which a reviewer can check without code. Since the code will not fit into the rebuttal text, the authors should provide it through an anonymous repository (e.g., https://anonymous.4open.science) during the rebuttal period.
[a] Wieckowski et al., "Towards a Live Software Decoder Implementation for the Upcoming Versatile Video Coding (VVC) Codec," ICIP 2020.
[b] Blard et al., "Overfitted Image Coding at Reduced Complexity," EUSIPCO 2024.
[c] Jacobellis and Yadwadkar, "Learned Compression for Compressed Learning," DCC 2025.
[d] Hojjat et al., "MCUCoder: Adaptive Bitrate Learned Video Compression for IoT Devices," DAGM GCPR 2025.
[e] Alakuijala et al., "JPEG XL Next-Generation Image Compression Architecture and Coding Tools," SPIE Applications of Digital Image Processing XLII, 2019.
W1 & Q1: Equal-cost attribution of human, LLM, and NAS
We agree that a prospective human-only study using the same probes would be informative. However, a post-hoc human-only trajectory would be inherently biased because the researchers already know the successful directions and newly discovered search axes. A rigorous comparison would require independent experts who are unaware of the original trajectory, while also controlling for their expertise, time, and candidate-training budget. We therefore do not claim that human–LLM evolution outperforms expert-only design.
Instead, we perform an additional ablation study to determine the effects of human review and search flexibility. Each training run uses the same training budget and evaluation protocol. The full and human-free variants use the same probe budget and the same 22 full training runs.
W2 & Q2: Conflicting perceptual metrics and blinded preference
We agree that the evidence is metric-dependent: PULSE is worse than MS-ILLM on LPIPS-Alex and CLIC-test FID, but better on LPIPS-VGG and DISTS. These metrics capture different perceptual properties, so we will revise the paper to report this trade-off rather than claim uniform superiority.
To provide complementary subjective evidence, we conducted a blinded study comparing PULSE-Perceptual with MS-ILLM at comparable bitrates across all evaluated images. Twenty participants judged which reconstruction was visually closer to the ground truth or marked the two as indistinguishable.
PULSE receives more preferences than MS-ILLM in all three categories, with the clearest advantage on text and face regions. For global images, both methods frequently produce reconstructions that are already very close to the ground truth at the tested bitrates, explaining the high indistinguishable rate. Overall, these results indicate comparable global perceptual quality, with a clearer preference for PULSE on ROI regions.