- Rating
- 3
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes Knowledge-Energy Reinforced Diffusion (KERD) for structured representation learning from heterogeneous spectral observations. The framework integrates Peak Graph modeling, energy-guided diffusion, and relation-consistent policy optimization to capture dependencies among spectral groups. An optional cohort graph incorporates auxiliary clinical information. Experiments on seven datasets comprising 72,057 spectral measurements demonstrate promising classification performance and robustness under different observation conditions.
Critical strengths
1.The paper is generally well organized, but the overall framework is relatively complex, and some figures are overly dense. The interactions between diffusion guidance and policy optimization could be explained more clearly.
2.The integration of structural relations into diffusion-based evidence selection provides an interesting perspective, although the methodological insights beyond existing graph learning and energy-guided optimization remain limited.
Critical weaknesses
1.Insufficient evidence for generalization under heterogeneous conditions. Although the paper evaluates seven datasets, each dataset is trained and tested independently, which does not directly establish cross-source or cross-center generalization. The robustness experiments mainly consider synthetic perturbations rather than realistic distribution shifts between acquisition devices, institutions, or populations. Furthermore, the additional computational cost of diffusion sampling and policy optimization is not fully evaluated. These limitations weaken the practical significance of the claimed robustness and efficiency.
2.Unclear necessity of diffusion-based reinforcement learning. Although component ablations are provided, the paper does not convincingly demonstrate why the relatively complex diffusion and reinforcement learning framework is necessary for spectral group selection. Comparisons with simpler differentiable feature selection, attention-based masking, or direct energy optimization under matched computational budgets would strengthen this claim.
3.Incomplete computational efficiency analysis. KERD involves graph encoding, iterative diffusion sampling, energy guidance, and policy optimization, potentially introducing substantial computational overhead. Although online inference latency is discussed, comprehensive comparisons of training time, memory consumption, and end-to-end inference cost against competing methods are lacking.
Questions for authors
- What are the fundamental methodological innovations of KERD beyond combining existing graph learning, energy-guided diffusion, and policy optimization techniques?
2.Why is diffusion-based policy optimization necessary for spectral group selection? Could the authors compare KERD with simpler differentiable selection or attention-based methods under comparable model capacity and computational budgets?
3.Can the authors provide cross-center, cross-device, or leave-one-domain-out evaluations to demonstrate generalization under realistic distribution shifts?
4 comments
Response to Reviewer ELNx [part 2]
[2/3] W1&W3: Computational Efficiency
❖ Additional Computational Cost Analysis: To improve the computational efficiency of KERD, we adopted fixed step numerical integration (Fixed-step Integration) in our original method.
✓ This technique reduces the computational overhead of solving continuous state evolution.
✓ We further conducted an efficiency comparison. Reducing the sampling steps from 32 to 8 achieves a speedup of approximately 3.02 times, as shown in Table R2.
✓ In addition, Table R3 compares training time, GPU memory usage, and end to end inference latency.
★ KERD achieves substantial improvements in predictive performance while keeping its additional computational overhead within an acceptable range.
⇒ The results are presented below.
☆ Table R2. Computational Efficiency of Fixed-step Reverse Diffusion Sampling.
| Sampling Steps | 32 | 16 | 8 | 4 | 2 |
|---|---|---|---|---|---|
| Relative Computation Steps | 1× | 2× fewer | 4× fewer | 8× fewer | 16× fewer |
| Time per Batch (ms) ↓ | 26.3 | 14.2 | 8.7 | 6.1 | 5.2 |
| Speedup ↑ | 1.00× | 1.85× | ★3.02× | 4.31× | 5.06× |
| Accuracy (%) ↑ | 93.61 | 93.45 | ★93.37 | 91.73 | 91.54 |
☆ Table R3. Computational Cost on Gastric-SERS.
| ❖ Method | F1 (%) ↑ | Training Time (min) ↓ | GPU Memory (GB) ↓ | End-to-end Inference (ms/batch) ↓ |
|---|---|---|---|---|
| ❖ Direct Band Weights | 76.14 | ≈170.0 | ≈4.1 | ≈26.5 |
| ❖ Stochastic Mask + RCGRPO | 87.54 | ≈192.0 | ≈4.7 | ≈30.1 |
| ❖ KEDP w/o RCGRPO | 89.21 | ≈184.0 | ≈4.9 | ≈38.7 |
| ►Full KERD (Ours) | 93.32 | ≈203.0 | ≈5.3 | ≈39.2 |
☆ Table R4. Cost Comparison with Representative Baselines.
| Dataset | Method | F1 (%) ↑ | Training Time (min) ↓ | Peak GPU Memory (GB) ↓ | End-to-end Inference (ms/batch) ↓ |
|---|---|---|---|---|---|
| Gastric-SERS | TimeFilter | 80.34 | ≈182.0 | ≈4.8 | ≈32.1 |
| Gastric-SERS | PatchTST | 82.09 | ≈159.0 | ≈3.7 | ≈25.5 |
| Gastric-SERS | MultiPatchFormer | 82.26 | ≈147.0 | ≈4.2 | ≈24.2 |
| Gastric-SERS | iTransformer | 85.94 | ≈196.0 | ≈4.7 | ≈37.9 |
| Gastric-SERS | KERD (Ours) | 93.32 | ≈203.0 | ≈5.3 | ≈39.2 |
⇒ We have added further details to the revised manuscript. The corresponding results are provided in Appendix J, Tables R3–R5.
[3/3] W1&Q3: Cross Center Generalization
• Robustness Experiments ✓: The baseline drift, fluorescence interference, and spike noise considered in KERD originate from real Raman spectrometers rather than arbitrarily designed perturbations. Therefore, these perturbations do not undermine the practical relevance of our robustness evaluation.
• Cross Center Generalization ✓: To go beyond evaluating each dataset independently, we conducted transfer experiments from three heterogeneous source domains to HD (See the table below). We compared three settings: training from scratch, using a frozen pretrained encoder, and full fine tuning.
☆ Table R5. Transfer Settings
| Component | Transfer Evaluation Protocol |
|---|---|
| Sources | Gastric-SERS, COVID-Serum, Ovarian Plasma |
| Target | Cross-Center Heart Disease (HD) |
| Pretraining | Shared spectral/graph encoders; source-specific heads |
| Scratch | Train KERD on HD only |
| Frozen | Freeze pretrained encoders; train HD linear probe |
| Fine-tuning | Adapt pretrained KERD to HD |
| Runs | 5 seeds (mean±std) |
☆ Table R6. HD Transfer Performance
| Protocol | Acc. (%) ↑ | F1 (%) ↑ | AUPRC (%) ↑ |
|---|---|---|---|
| Scratch | 93.26±4.38 | 93.22±4.37 | 97.07±2.43 |
| Frozen | 94.65±1.40 | 94.74±1.35 | 98.27±0.60 |
| Fine-tune | 95.81±1.58 | 95.82±1.64 | 98.34±1.36 |
The frozen encoder achieves an F1 score of 94.74%. Full fine tuning further improves the F1 score to 95.82%, representing a gain of 2.60 percentage points over training from scratch.
★ These results suggest that the spectral representations learned by KERD have the potential to generalize across centers. The corresponding experiments are provided in Appendix K.
Finally, we sincerely thank you again for your valuable time and encouragement.
We wish you all the best.
With our deepest respect.
Thank you for your reply. The author's rebuttal addressed most of my concerns, and since my original rating was positive, I will maintain it.
We sincerely appreciate your positive feedback on our work.
Thank you so much for your positive feedback and continued support! We truly appreciate your professionalism and kindness. Hope everything goes well for you.
Response to Reviewer ELNx [part 1]
First, we would like to express our deepest respect. Thank you for carefully reviewing our work.
We sincerely appreciate your positive evaluation and recognition of our study.
★ We greatly value your suggestions, and we will address your questions one by one below.
We have carefully reviewed and organized your valuable comments.
★ Please rest assured that we have checked all your questions several times to ensure that none were missed. We have grouped related concerns as follows.
[I]. Explanation of Weaknesses and Questions
[1/3] W2&Q1&Q2: Why Use Diffusion Based RL?
• Thank you for your question. Existing feature weighting methods can effectively identify important spectral bands. However, in Raman spectroscopy, preserving the relationships among spectral peaks is essential for extracting stable discriminative information from heterogeneous spectra. This motivated us to reconsider traditional band selection methods.
❖ Notably, a spectral peak may be discriminative on its own, but its combination with other peaks may not be equally effective.
❖ Direct weighting can implicitly learn feature interactions, but it lacks explicit exploration of candidate band combinations.
► Therefore, we considered two complementary mechanisms:
(i) ✓ constructing an energy function from shared relational prototypes to guide diffusion in exploring different band combinations.
(ii) ✓ using prototype consistency and prediction feedback to evaluate candidate combinations and continuously refine the selection policy.
⇒ Thus, diffusion based RL naturally follows from our goal of turning the progressive exploration of band combinations into a sequential decision process that can be continuously improved through feedback.
❖ However, keeping the exploration direction consistent with the optimization objective is not straightforward.
⇒ We carefully analyzed these challenges. We demonstrated that combining relation guided diffusion exploration with prototype driven policy feedback provides a strong baseline. This is the fundamental methodological innovation and core contribution of our work.★
• In our original manuscript, we compared KERD with 15 baselines, including 9 general baselines and 6 domain specific baselines (Section 4.1 and Appendix H). These include several attention based methods, such as PatchTST, Raman-OSDL, and iTransformer.
★ In addition, we introduced four new baselines from two categories: Differentiable Selection (Hide&Seek, ICML'26, and TT-Sparse, ICML'26) and Direct Energy Optimization (SEA, NeurIPS'25, and EBT, ICLR'26).
⇒ Our comparison with 19 baseline methods further demonstrates the effectiveness of KERD. More detailed results are provided in Appendix L.
☆ Table R1. Comparison with Differentiable Selection and Direct Energy Optimization Methods.