- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper provides a continuous time ODE perspective into neural Belief Propagation framework, using off-the-shelf ODE solvers which enhanced their iterative decoder performance. Superior performance is gained from their design, especially from the retrying mechanism, though the raw performance is already leading.
Critical strengths
- This method attains substantially better BER compared to other compared methods, across multiple LDPC family codes. The introduction of perturbation further improves their performance.
- Their introduction of the ODE formulation for Belief Propagation into neural BP decoder is rather new in this field, and gives rise to the introduction of ODE solvers.
Critical weaknesses
- The comparison could be more rigorous, with more details described in the 4-th question for the authors. SBECC is a general neural decoder, while the neural BP decoder baseline only includes ARBP while other neural BP decoders were proposed and could serve as better baselines for neural decoder. Moreover, perturbation’s contribution for improved results is substantial and insufficiently separated. As explained in the question, evaluation of the other methods without perturbation gives an additional advantage for BeliefFlow, and Table 2 only partially attributes to this.
- The necessity of bringing in ODE formulation is not compelling, see question 3.
Questions for authors
-
Although Neural BP is light in computation and parameters, the authors did not present a qualitative comparison of either latency or computational cost in actual end-to-end decoding setups. These results might clarify the limitation claims at line 475.
-
The effect of different NFE steps with different ODE solvers is not clear; one might hypothesize that RK4 superseded Euler because it requires more function evaluations for accuracy. The authors are encouraged to compare the two under the same NFE budget as well, or provide some insights into this.
-
The necessity and practical benefit of the continuous-time formulation remain unclear. Equation (10) shows that Euler discretization yields a damped, weight-shared recurrent message-passing network, which can be formulated directly in discrete time with a damping coefficient.
-
As the bank of positional embeddings is essentially frozen/learnable additive Gaussian perturbation, it is then rather to ask whether they are positional embeddings or serve as perturbation, and to propose a Gaussian noise at say level, with the same candidate and output merging setups for other compared methods. In my setups, the authors' reported -ln BER might be superseded by a 50-iteration BP decoder.
-
The presentation of the authors' model setup is a bit unclear; readers shall resort to Figure 1, the appendix, and their source code for understanding the model's computation path. It is encouraged to present a standalone and complete description in the appendix.
-
Is the training/testing set division a consequence of the invalidity of zero codeword symmetry for BeliefFlow? Or is the symmetry still retained?
-
Can you make a comparison with perturbed BP decoding?
Some references for perturbation decoding:
[1] F. Leduc-Primeau, S. Hemati, S. Mannor, and W. J. Gross, "Dithered Belief Propagation Decoding," IEEE Transactions on Communications, 60(8), 2042–2047, 2012.
[2] J. Gao, H. Wang, and K. Tian, "Noise-Assisted List Decoding for 5G LDPC Codes," IEEE VTC-Fall, 2022.
10 comments
Q1 Actual decoding latency and computational cost
Reviewer comment
Although Neural BP is light in computation and parameters, the authors did not present a qualitative comparison of either latency or computational cost in actual end-to-end decoding setups. These results might clarify the limitation claims at line 475.
We agree that parameter count alone does not characterize decoding cost. In the revised manuscript, we have added Appendix A.12, which reports decoding time, peak memory usage, operation counts, and BER for the evaluated implementations, with retry and without retry decoding. For example, Table 21 presents the following results at 4 dB:
| Code | Method | BER | Time, ms/codeword | GOps/codeword |
|---|---|---|---|---|
| LDPC(49,24) | SB-ECC | 4.35e-4 | 17.6 | 0.526 |
| LDPC(49,24) | BeliefFlow, RK4, step size 0.1, retry | 3.00e-4 | 249 | 74.0 |
| LDPC(121,80) | SB-ECC | 1.45e-4 | 20.2 | 1.04 |
| LDPC(121,80) | BeliefFlow, RK4, step size 0.1, retry | 4.42e-5 | 289 | 139 |
For retry decoding, operation counts are summed across trajectories. Aggregate inference time is the measured batch runtime multiplied by the number of trajectories in the batch. BeliefFlow’s GPU memory usage is reported for a single trajectory. BeliefFlow also offers accuracy-cost trade-offs through the choice of solver and step size.
We also evaluated CPU implementations of OSD and BP-OSD, as suggested by another reviewer. As expected, both methods are substantially faster than BeliefFlow on shorter codes. For longer codes, the growing search space makes high-order standalone OSD increasingly expensive.
Table 10 in Appendix A.1 also reports how often the initial attempt triggers retries. At 4 dB, the block retry rate ranges from 0.123% to 3.53% across the six codes. Although these rates do not directly quantify the additional inference cost, they indicate how frequently retry decoding is required.
Q2 Function evaluations and solver comparisons
Reviewer comment
The authors are encouraged to compare the two under the same NFE budget as well, or provide some insights into this.
The NFE values in Table 5 were obtained by evaluating the same RK4-trained weights for each code with different inference solvers. The mean of the per-setting RK4/Euler NFE ratios is approximately 3.19<4. Thus, RK4 takes fewer integration steps on average but incurs more function evaluations. Euler nevertheless achieves comparable decoding performance, with only modest differences from RK4. Appendix A.2 further compares models trained and evaluated with Euler or RK4 and supports the same observation. These results suggest that higher-order solvers are not essential for obtaining strong decoding performance in the tested settings.
For evaluation under the same NFE budget, we would like to request an exemption. In our experiments, the realized NFE is not a preset hyperparameter and is difficult to match across solvers. Each decoding attempt terminates when the parity-and-confidence criteria are met or the maximum integration horizon is reached. The reported NFE is averaged over the decoded samples.
One way to adjust the mean NFE is to vary the integration horizon. However, this adjustment only affects difficult samples that reach the horizon without satisfying the stopping criteria. With this approach, we cannot precisely control the mean NFE and can only seek an approximate match through a grid search over integration horizons.
We would also expect that extending Euler decoding to match RK4’s NFE would yield results similar to the current Euler configuration. Conversely, truncating RK4 when the NFE budget is exhausted would be expected to reduce its decoding performance.
Q3 Purpose of the continuous-time formulation
Reviewer comment
The necessity and practical benefit of the continuous-time formulation remain unclear. Equation (10) shows that Euler discretization yields a damped, weight-shared recurrent message-passing network, which can be formulated directly in discrete time with a damping coefficient.
Related critical weakness
The necessity of bringing in ODE formulation is not compelling, see question 3.
We agree with the equivalence identified by the reviewer. Applying forward Euler to the learned dynamics gives
+\Delta t\,f_\theta(M^{(\ell)};\widetilde Y),$$ which is a damped, shared-weight recurrent message-passing update that can also be defined directly in discrete time. Our results do not establish that continuous time is necessary for the reported decoding performance. The results in Table 4 and Appendix A.2 further suggest that higher-order solvers are not essential for the proposed method. Nevertheless, we would still like to emphasize the practical importance of adopting the neural ODE framework. A direct discrete implementation would require us to explicitly manage the iterative updates and unrolling during training and inference. Reproducing the current adjoint-based training procedure could also involve duplicating functionality already provided by existing neural ODE libraries. Furthermore, the duration-aware loss would need to be reformulated in terms of discrete iterations, since its current definition directly depends on integration duration. The neural ODE framework also allows us to explore accuracy-cost trade-offs by choosing different solvers and step sizes, as illustrated in Tables 4–7 and Appendix A.12. ---- ## Q4 Random features, perturbations, and attribution of the gains **Reviewer comment** > As the bank of positional embeddings is essentially frozen/learnable additive Gaussian perturbation, it is then rather to ask whether they are positional embeddings or serve as perturbation, and to propose a Gaussian noise at say level, with the same candidate and output merging setups for other compared methods. In my setups, the authors' reported -ln BER might be superseded by a 50-iteration BP decoder. We agree that the term **feature perturbations** better describes their role. The current manuscript uses this terminology. The feature vectors are reassigned to nodes for each received sample and decoding attempt, so they do not encode persistent node identities. The positional-encoding-style perturbations were originally designed to support cross-code transfer without assigning persistent identities to nodes. These features result in generating diverse decoding trajectories when their node assignments are resampled. We are also interested in whether these perturbations could be replaced by directly sampled noise and whether models trained without perturbations could benefit from perturbation-based retries. The corresponding experiments and results are presented in Appendix A.3. The results show that models trained without feature perturbations perform substantially worse than the default perturbation-trained models when given the same frozen-bank retry perturbations. This highlights the importance of training with feature perturbations before applying perturbation-based retries. Replacing frozen-bank retry perturbations with moment-matched uniform samples produces much smaller changes in performance. This suggests that the decoder learns to accommodate feature perturbations without depending on the exact frozen-bank entries used for retries. We also emphasize that, even **without feature perturbations or retries, BeliefFlow outperforms the reported SOTA baseline** in most settings in Table 2. We also agree that comparisons against unperturbed baselines alone cannot establish an advantage over other perturbation-assisted decoders. Appendix A.7 therefore compares BeliefFlow with NMS and noise-assisted NMS, as discussed under Q7. NMS provides a computationally efficient approximation to BP, and its noise-assisted retry strategy is adapted from Gao et al. \[2]. Perturbation-based retries improve both methods, and BeliefFlow generally outperforms NMS across the reported settings, both with and without retries. > [2] J. Gao, H. Wang, and K. Tian, "Noise-Assisted List Decoding for 5G LDPC Codes," IEEE VTC-Fall, 2022. As to BP-50, the BP/NMS baseline already uses up to 200 iterations with parity-based early stopping, so a 50-iteration cap would only reduce its opportunity to converge.
We would like to thank the reviewer for recognizing the decoding improvements and the novelty of our work. Your constructive comments have helped us improve the manuscript. We provide point-by-point responses to each of your concerns below.
If our responses resolve the reviewer’s concerns, we hope the reviewer could raise the score and support the paper in discussion. Given the paper’s current borderline standing, your support in the Reviewer-AC Discussion could be decisive for the final outcome.
Changelog of the manuscript
Before addressing the individual comments, we summarize the main changes from the original submission. In particular, the appendix now contains 12 subsections, listed below. These provide additional experimental results and implementation details to address the questions raised during review. The revised PDF has been uploaded and is available for review.
Contents of the Appendix