- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes FluxC, a zero-shot codec that uses a pretrained Flux model as a compression prior without any additional training. Whereas the existing DiffC Flux reparameterizes Flux onto a VP diffusion path, FluxC communicates noisy latents via reverse channel coding directly on Flux's native OT path. At the receiver, the image is reconstructed either by one-step posterior-mean decoding (FluxC-1) or by many-step ODE integration (FluxC-ODE). The authors analyze the codec along three axes: coding cost and bit allocation over path time, reconstruction method, and low-rate distortion behavior. They show that, at matched SNR, the choice of path does not change the ideal rate but only redistributes bits over time, and that in the low-rate limit, deterministic ODE reconstruction reduces distortion faster than ancestral sampling. Experiments on Gaussian sources and natural images are reported to support these predictions, and the method is reported to be competitive with existing neural codecs in the ultra-low bitrate regime.
Critical strengths
The main strength of this paper lies not in the superiority of a new codec design, but in its analytical treatment of Flux-based zero-shot compression and its transparent experimental reporting.
- By using the pretrained FLUX.1-dev as a compression prior without additional training, the paper extends DiffC-style zero-shot coding to the native parameterization of a modern rectified flow model, which is of practical relevance.
- The coding cost is decomposed into an information term that depends only on the SNR and a model-mismatch term, and is further re-expressed in terms of Flux's velocity regression error and the bit allocation over path time. This clearly shows that the choice of path does not change the ideal rate.
- The paper establishes that, in the low-rate limit, distortion decreases at order √R for deterministic ODE reconstruction and at order R for ancestral sampling, and verifies this in closed form for Gaussian sources.
- Results that disagree with the theory are reported transparently, e.g., DiffC-A achieving higher PSNR than DiffC-F and rankings that vary across metrics. Encoding/decoding times and the effect of the number of encoding steps are also provided.
Critical weaknesses
-
Limited theoretical gain and weak empirical support for Result 1. The paper is primarily analytical rather than demonstrating the superiority of a new technique, and Result 1 is essentially the only component that offers a theoretical gain. The cleanest test of Result 1 in Fig. 3 is DiffC Flux-F versus DiffC Flux-A, which differ only in the reconstruction method under the same backbone and path; however, the difference between them is not clearly visible. Moreover, it is questionable whether the distortion reduction below the extremely low bitrate of 2 × 10⁻⁴ bpp is of practical significance.
-
Missing comparisons with recent generative codecs. Beyond PerCo and DiT-IC, comparisons with other recent generative codecs such as OneDC, StableCodec, and AEIC are not provided. Even if the proposed method does not outperform them, such comparisons are necessary to assess its performance level.
-
Overextension of Result 1. Result 1 characterizes the leading-order rate of distortion reduction as R → 0 from a common zero-rate distortion D₀; it does not by itself predict the absolute distortion ranking at a given rate. The paper nevertheless invokes it to explain the PSNR advantage of FluxC-1 and FluxC-ODE over a wide low-rate range in Fig. 4, which extends well beyond the asymptotic regime. Moreover, FluxC-1 is a posterior-mean decoder and falls outside the scope of Result 1. Please (i) report the empirical D₀ of each method, and (ii) verify the predicted scaling directly via the slope of log(D₀ − D) versus log R.
-
No demonstrated RDP advantage of the OT path. The paper does not demonstrate an RDP advantage of performing RCC directly on Flux's OT path over the existing VP-normalized approach (DiffC Flux). A controlled comparison with the same backbone, step schedule, and reconstruction method (e.g., FluxC-ODE vs. DiffC Flux-F) is needed.
-
Computational cost should be discussed as a limitation. DiffC-style methods typically require tens to hundreds of seconds per image, which is several orders of magnitude slower than conventional neural codecs (e.g., MS-ILLM). Although this issue is not specific to the proposed method, it is a critical practical challenge for this line of research and should be discussed as a limitation.
Questions for authors
- Can the authors provide a clearer comparison between DiffC Flux-F and DiffC Flux-A (e.g., numerical ΔMSE values at several rates or a figure in which the two are clearly distinguishable) to verify Result 1 on natural images? In addition, what is the practical significance of the distortion reduction below 2 × 10⁻⁴ bpp?
- Can the authors include comparisons with recent generative codecs such as OneDC, StableCodec, and AEIC to clarify the performance level of the proposed method?
- Can the authors (i) report the empirical zero-rate distortion D₀ of each method, and (ii) verify the predicted scaling of Result 1 directly via the slope of log(D₀ − D) versus log R? How do the authors justify using Result 1 to explain the PSNR advantage over the wide rate range in Fig. 4, given that it is an asymptotic result and that FluxC-1 falls outside its scope?
- Can the authors provide a controlled comparison between FluxC and DiffC Flux with the same backbone, step schedule, and reconstruction method (e.g., FluxC-ODE vs. DiffC Flux-F) to isolate the effect of performing RCC on the OT path?
- Can the authors discuss the computational cost of the method as a limitation, including a comparison of encoding/decoding time with conventional neural codecs?
5 comments
Clarification on the Contribution of Result 1
Thank you for your detailed responses. Some of my concerns have been addressed.
However, I would appreciate further clarification regarding the significance of Result 1, which appears to be one of the main contributions of this paper.
Beyond the existing understanding of posterior sampling and deterministic transport, what new insights or practical guidance does Result 1 offer for the design of generative compression systems?
Thank you for taking the time to review our revisions and share your feedback. What we are interested in is that how to reconstruct an image that is faithful to the input, in the MSE sense, from a very small amount of received information. This question motivates the low rate analysis of Result 1, which contributes both theoretically and practically.
Theoretically, Theis et al. [1] showed that ODE reconstruction achieves up to a 3 dB gain over ancestral sampling, attained at high rates. As , however, both distortions approach , so this ratio tends to 1 and no longer distinguishes the decoders. Result 1 complements their analysis at low rates: ODE reconstruction reduces the distortion at order , whereas ancestral sampling does so at order . Together with Appendix E.1, which shows that ODE reconstruction is better at every SNR for Gaussian sources, this extends their comparison of the two decoders from high rates to the whole rate range.
Practically, Result 1 suggests choosing ODE reconstruction at ultra low rates (the fitted slopes agree with the predicted and ; Figure 3). Combined with Observation 1, it suggests that the choice of the decoder matters more than the choice of the path (ODE reconstruction saves 22–37% of the rate; Table 1). Combined with Appendix E.1, it suggests that ODE reconstruction is better over a wide range of rates (it needs less rate in every rate decade from to bpp; Table 1).
In summary, for our question, Result 1 shows theoretically and empirically that choosing ODE reconstruction as the decoder is beneficial in the MSE sense. Recent work on neural image compression is increasingly interested in decoder design at ultra-low rates [2, 3, 4], and we believe that Result 1 is useful for such designs and for practical applications.
[1] Theis, Lucas, et al. "Lossy compression with gaussian diffusion." arXiv preprint arXiv:2206.08889 (2022).
[2] Careil, Marlene, et al. "Towards image compression with perfect realism at ultra-low bitrates." International conference on learning representations. Vol. 2024. 2024.
[3]Zhang, Tianyu, Dong Liu, and Chang Wen Chen. "Ultra-low bitrate perceptual image compression with shallow encoder." Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. 2026.
[4] Xue, Naifu, et al. "One-step diffusion-based image compression with semantic distillation." Advances in neural information processing systems 38 (2026): 37108-37144.
We thank the reviewer for the thorough and precise review. Several questions were shared with other reviewers, and we answer them in the General Response: D0 and the slope of log(D0−D) versus logR in General Response 2, and the controlled comparison of the path and the reconstruction method in General Response 1. We answer the remaining questions below.
We report the PSNR BD-rate of DiffC Flux-F relative to DiffC Flux-A within each rate below. The negative value means DiffC-F requires less rate to achieve the same PSNR than DiffC-A. Therefore DiifC Flux-F consume less rate in every rate on all datasets.
Appendix E.1 shows that ODE reconstruction, which stays aligned with the posterior mean instead of drawing a independent posterior sample, has lower distortion than ancestral sampling at every SNR for Gaussian source. Natural images also show the same trend that with the Flux backbone, ODE reconstruction requires 22–37% less rate than ancestral sampling for the same PSNR in every rate decade from 10−4 to 10−1 bpp (Table 1).
Extremely low rates are relevant in practice, e.g., for satellite and remote-sensing imagery, where the downlink bandwidth is severely limited [1, 2], and for low-power IoT links such as LoRa, which offer only tens of kbps [3]. When the rate is constrained to be extremely low, choosing the method with the lowest distortion at that rate is the natural criterion. Although 2×10−4 bpp corresponds to only about 50 bits for a 512×512 image, a high resolution image carries proportionally more bits (about 1,700 bits for a 4K image). Given the growing use of high resolution images such as 4K and the need to store a lot of images, the distortion reduction at extremely low bpp becomes more useful as the resolution increases.
We added such recent works in revised version in Figure 4, 13, 14 and 15, and Table 9. At 0.01 bpp and above, these codecs achieve better distortion and perceptual quality than FluxC, which is expected since they are trained for compression. Without any training for compression, FluxC operates below 0.003 bpp, where these codecs report no operating points. Tuning the decoder for perceptual metrics is left for future work.
[1] CCSDS 122.0-B-1, Image Data Compression, Blue Book, Issue 1, Nov. 2005.
[2] Ye et al., "Map-Assisted Remote-Sensing Image Compression at Extremely Low Bitrates" (2024).
[3] De, Soumadeep, et al. "Multimedia transmission over lora networks for iot applications: A survey of strategies, deployments, and open challenges." Sensors (Basel, Switzerland) 25.23 (2025): 7128.