- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper proposes CodaCache, a training-free causal controller that adaptively coordinates CFG branches. It estimates the effects of omitting the unconditional prediction and reusing the conditional one from completed denoising history, using latent motion and time separation. It combines these estimates to choose Full CFG, conditional-only refresh, or conditional-only reuse before current branch evaluation, without extra denoiser calls.
Critical strengths
1、 Identifies and empirically validates nontrivial interactions between the two CFG branches during prediction reuse. 2、 Effectively reduces CFG-related network computation, accelerating 3D generation while maintaining average geometric quality close to that of full CFG.
Critical weaknesses
1、 The method primarily relies on heuristic, history-based error estimates, without theoretical bounds on the final geometric error or an explicit mechanism for controlling error accumulation. 2、 The comparisons primarily involve acceleration methods developed for image and video diffusion models, with relatively limited comparisons against methods specifically designed for 3D generation. 3、 The computational overhead of offline calibration and its impact on the overall acceleration benefits are not quantified.
Questions for authors
1、 Some errors are occurred in the pipeline figure, formulations cannot present, missing the details of the proposed structures. The paper presentation should be largely improved. 2、 The contributions of the proposed methods should be clarified and highlighted in the Introduction section. The paper writing should be improved. 3、 Some recent methods should be compared and discussed, such as: [1] Gen-3diffusion: Realistic image-to-3d generation via 2d & 3d diffusion synergy. [2] Ouroboros3d: Image-to-3d generation via 3d-aware recursive diffusion. [3] Rethinking Image-to-3D Generation with Sparse Queries: Efficiency, Capacity, and Input-View Bias. [4] GECO: Fast Generative Image-to-3D Within One SECOnd. [5] Cycle3d: High-quality and consistent image-to-3d generation via generation-reconstruction cycle. [6] Ultra3D: Efficient and High-Fidelity 3D Generation with Part Attention. 4、 Why the proposed method can achieve the better efficiency than other methods? The more detailed motivations and explanations should be provided.
6 comments
Response to W2&Q3 and Q2
W2&Q3
Thank you for your suggestion. We have added quantitative comparisons with seven methods and explained, one by one, how SparseGen, Cycle3D, and Ultra3D differ from our work and how they relate to the scope of comparisons in this revision.
We have compared three 3D generation methods (GECO, Gen-3Diffusion, and Ouroboros3D) and four training-free acceleration methods (Fast-SAM3D, LEAP, TeaCache, and EasyCache) on Toys4K, using the same evaluation setup as the main experiments. Full CFG and CodaCache are based on Hunyuan3D 2.1. All speedups are calculated relative to Full CFG in the table.
| Method | CD ↓ | F-score (%) ↑ | Throughput (assets/s) ↑ | Speedup (×) ↑ |
|---|---|---|---|---|
| Full CFG | 0.0159 | 75.36 | 0.1873 | 1.00 |
| GECO | 0.0250 | 68.57 | 0.4176 | 2.23 |
| Gen-3Diffusion | 0.0190 | 74.91 | 0.2022 | 1.08 |
| Ouroboros3D | 0.0240 | 71.11 | 0.2303 | 1.23 |
| Fast-SAM3D | 0.0201 | 75.16 | 0.4251 | 2.27 |
| LEAP | 0.0197 | 75.10 | 0.4158 | 2.22 |
| TeaCache | 0.0199 | 75.01 | 0.4045 | 2.16 |
| EasyCache | 0.0214 | 74.73 | 0.4289 | 2.29 |
| CodaCache | 0.0159 | 75.35 | 0.4383 | 2.34 |
In this setting, compared with the seven added methods, CodaCache achieves the highest throughput, the lowest mean CD over valid outputs, and the highest mean F-score. Compared with Full CFG, CodaCache achieves a 2.34× speedup, with the same reported mean CD of 0.0159 and a mean F-score decrease of 0.01 percentage points.
For the other three works, we explain how each design relates to CodaCache and the conditions for quantitative comparison in this revision.
(1) SparseGen uses learnable sparse 3D queries to generate a 3D Gaussian representation in one forward pass, improving efficiency through its output representation and network design. CodaCache keeps the existing representation and pretrained backbone, and accelerates generation by coordinating branch computation. SparseGen's current public configurations and weight links are for SRN Cars. We have not found weights for its open-category experiments in its public resources, so we discuss its method in this revision and have not included it in the cross-category mesh evaluation on Toys4K. Paper; official implementation.
(2) Cycle3D cycles through 2D generation, 3D reconstruction, and rendering during denoising to improve consistency across views. CodaCache uses trajectory history to decide when to omit U and reuse C. Cycle3D's loop depends on a specially trained reconstruction model. We have not found the corresponding weights in its official public resources, so we provide a comparison of mechanisms in this revision. Paper; official implementation.
(3) Ultra3D uses coarse and fine generation stages and part attention to reduce the cost of high-resolution generation by improving computation within the network. CodaCache reduces the number of branch evaluations during inference. Ultra3D's current official site provides a project showcase and an online demo. We have not found a model implementation and weights for local evaluation on the same hardware, so we discuss its method in this revision. Paper; official project.
We have added the design differences of these three methods to the first paragraph of Section 2, “Related Work,” in the revised manuscript. We have reported the setup and results of the added comparisons in the “Additional comparisons on Toys4K” paragraph and Table 9 of Appendix C.
Q2
Thank you for your suggestion. We have highlighted the following three contributions in the introduction to clarify the link from the branch-interaction observation to score design and then to acceleration results.
(1) Identifying interactions between branch treatments. Under the same refresh rule in Hunyuan3D, reusing C/U together produces geometry closer to Full CFG than reusing C while recomputing U.
(2) Proposing joint scoring based on trajectory history. We jointly assess the effects of U omission and C reuse on a common solver-increment scale, using a shared threshold to coordinate actions for the two branches.
(3) Proposing CodaCache, a training-free inference acceleration framework for image-to-3D generation. Across four settings with two models and two datasets, it achieves lower CFG denoising FLOPs, lower mean CD over valid outputs, and higher mean F-score than the acceleration methods compared in Table 1.
We have listed these contributions at the end of Section 1, “Introduction,” in the revised manuscript, under “Our contributions are as follows.”
Response to Q4
Q4
Thank you for your question. CodaCache reduces computation by reusing complete predictions and uses sample trajectories to choose when to reuse them. Compared with Full CFG, it reduces CFG denoising FLOPs by 55.3–62.4%. Across the four settings in Table 1, it uses fewer FLOPs and achieves better mean geometric quality over valid outputs than the compared acceleration methods. Specifically, it has two advantages:
(1) Reusing predictions directly to reduce branch computation. In the later denoising stages of Hunyuan3D, prediction directions change little between adjacent steps, suggesting that existing predictions can be reused across steps (Figure 1(b)). CodaCache provides three actions: F recomputes C and U, P recomputes only C, and R omits U and directly uses the cached C. Thus, R needs no branch evaluation at the current step. Table 3 shows that removing R increases CFG denoising FLOPs to 70.4–82.6% of Full CFG, showing the computation saved by reusing complete C predictions.
(2) Making decisions for each sample to choose when to reuse and when to refresh. The effect of reuse changes with the denoising stage and the treatment of the other branch (Figure 2(b) and Figure 3). CodaCache jointly scores U omission and C reuse using each sample's trajectory history, then selects the action with the fewest branch evaluations among those that meet the acceptance conditions.
Table 2 further shows the value of choosing when to reuse. On Hunyuan3D, increasing the fixed reuse count from r4 to r5/r6 reduces FLOPs but increases CD and lowers F-score. Compared with Fixed CodaCache-r2, CodaCache achieves lower mean CD over valid outputs and higher mean F-score in all four settings.
We have added this efficiency analysis to the second paragraph of Section 5.2 in the revised manuscript, which starts with “Two design choices account for these savings.” The action definitions are in Section 4.1, and the fixed-policy comparison and component ablation are in Tables 2 and 3, respectively.
We hope these explanations and experimental results address your questions.
Response to W1, W3 and Q1
Thank you for your valuable and helpful comments.
W1
Thank you for your suggestion. Final geometry error needs to be analyzed across the complete generation process. We control error through step-by-step scoring and refreshes, and use measurements across several settings to assess the scoring mechanism and default parameters.
(1) Error passes through several interacting stages. Branch omission and prediction reuse change later denoising states and action choices. Their effects also pass through later denoising, decoding, and mesh extraction, so it is difficult to obtain a meaningful final geometry error bound from local history-based scores alone. At each step, CodaCache uses the cumulative latent changes and time separation since the corresponding observation or refresh to compute scores. It refreshes or returns to Full CFG when the acceptance conditions are not met.
(2) Checking the overall effect through final geometry. For the same set of Hunyuan3D objects, Figure 2(a) shows a mean CD of 0.0012 between CodaCache and Full CFG, compared with 0.0049–0.0271 for controls using preset branch-handling and refresh strategies. This shows that CodaCache retains a smaller geometry deviation after complete generation.
(3) Testing the scores and default parameters across several settings. CodaCache uses the same action threshold of 0.15 in all four settings across two models and two datasets. Compared with Full CFG, the mean CD over valid outputs increases by at most 0.15% in relative terms, and the mean F-score decreases by at most 0.10 percentage points (Table 1). The threshold and history-count experiments on Hunyuan3D 2.1/Toys4K in Appendix E, Table 12, further support the efficiency–quality tradeoff of the default settings. These results provide experimental evidence for scoring and parameter choices on the tested models and datasets.
We have explained trajectory feedback and the refresh mechanism in Section 4.3, “Causal execution, fallback, and fixed configuration,” of the revised manuscript. We have reported the final geometry results and the experimental evidence for parameter choices in Figure 2(a), Section 5.2 and Table 1, and Appendix E, Table 12.
W3
Thank you for your suggestion. We have added measurements of offline calibration time. Including the per-image share of calibration time, CodaCache still achieves a 2.38× speedup on TRELLIS.2/Toys4K.
Its efficiency is therefore ensured:
(1) Calibration is performed once, and its results are shared by later generations. Calibration is completed before inference. The resulting support intervals are fixed and used for later generation, with no need to repeat calibration for each image.
(2) Measuring calibration cost and its effect on speedup. The calibration time allocated to each image is 0.0229 seconds, about 1.2% of the Full CFG generation time per image. Including this cost, CodaCache takes 0.8303 seconds per image for calibration and generation combined.
We have added these measured times and their calculation details to the calibration-cost paragraph in Section 5.2 and the “FLOPs and generation time” paragraph in Appendix C of the revised manuscript.
Q1
Thank you for your suggestion. We have improved the explanation accompanying Figure 4 and clarified the basis of joint scoring and the controller's execution order.
(1) Clarifying the links between modules in the figure. The caption further explains how historical anchors, trajectory distances, and rates of change are used for scoring, how the image condition is used by the C branch, and how feedback from history is used for later decisions.
(2) Clarifying the joint scoring formula. We have explained why Eq. (5) combines two history-based scores on a common solver-increment scale, and how a shared threshold coordinates U omission and C reuse.
(3) Explaining the order of cache and feedback updates. We have stated that, when the old cache is available, F/P actions first observe the C-reuse error and then update the cache. Only valid rates of change update the estimates, and new observations are used for later decisions.
These changes appear in the Figure 4 caption, the text around Eq. (5) in Section 4.1, and the second paragraph of Section 4.3. The complete execution procedure and parameter settings are given in Tables 4 and 5 of Appendix B, respectively.