- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
This paper proposes I-FGMP, a neural BP-type decoder for LDPC codes. The main idea is to reuse common update rules across iterations. The authors show improvements over other neural-BP decoding baselines, mainly on six short LDPC codes. The approach is of some interest, but the contribution is very minor.
Critical strengths
The proposed approach improves on the selected baselines.
Critical weaknesses
The main weakness is that the contribution is too limited and lacks sufficient depth to warrant publication at ICLR. The shown improvements with respect to other neural BP decoders are promising, but the contribution is simply too narrow.
The construction is largely heuristic, with neither theoretical analysis nor novel insight.
For a paper that evaluates the performance of LDPC decoders, the results should be reported in terms of FER curves (alternatively BER curves, but FER are preferred) as a function of Eb/N0, as it is customary in any coding paper. The current way to present the results wouldn't be acceptable in more traditional venues for coding papers, and ML conferences should not be an exception. One needs to quantify the gains (in Eb/N0) and assess the behavior in the waterfall and error floor regions.
The main experiments concern lengths 49-128. But for these block lengths, most of the codes reported are not competitive. Polar codes (with CRC and list decoding), BCH codes with OSD, or other LDPC codes (potentially with OSD), would be better alternatives. As an example, only in the early times of LDPC codes one would report results on the MacKay code. MacKay codes are not competitive and hence they should not be considered when evaluating performance.
The comparison is insufficient given the computational cost of the proposed decoder. Comparisons with LDPC+OSD and other strong alternatives such as BCH+OSD and polar codes with CRC and list decoding, and a complexity discussion, are needed.
Questions for authors
Can the authors provide FER and BER curves, with gains measured in at fixed error rates?
2 comments
Dear authors,
Thank you for your detailed responses and for taking the time to address the reviewer's comments.
Unfortunately, my main concern remains: the contribution of this work is simply too limited to warrant publication at ICLR.
Every year, a large number of papers make relatively minor contributions that are nevertheless valid and potentially useful to the research community. However, not all such contributions meet the bar for a top-tier venue like ICLR. I firmly believe that this paper falls into this category. I have carefully considered the authors' responses, but they have not changed my assessment of the paper's overall significance. I remain confident in my evaluation and stand by my original recommendation.
Given that this fundamental concern remains unaddressed, I do not believe that further discussion of the other comments would materially change my overall assessment. To be clear, I do not question that this work may be suitable for publication in a more less selective venue. However, I do not believe it meets the publication threshold for ICLR.
Best regards,
The reviewer.
Thank you for your time and effort in reviewing our paper.
Response to W1, W2:
We have rewritten Section 4 and added Section 4.1.1 to clarify the architectural contribution and its motivation. Our core contribution is the FGMP operator, which implements adaptive message exchange through node-wise modulation and gating around fixed graph aggregation, avoiding explicit pairwise score evaluations.
Eq. (11) reveals that node-wise modulation and gating induce a separate rank-one reweighting of graph edges in each feature channel, providing interaction diversity across channels. This factorization is motivated by LDPC sparsity and local tree structure: Appendix B proves that, when the node factors vary freely within their activation ranges, arbitrary positive edge weights are representable if and only if the bipartite support graph is a forest. Higher-rank interactions therefore offer no additional edge-weighting flexibility within such isolated tree neighborhoods. However, cycles can make a single rank-one component insufficient. Channel mixing addresses this limitation by combining components across channels; when those channels carry the same message, their combination can form a higher-rank interaction, illustrating how message diversity can be traded for interaction flexibility. Because FGMP jointly learns messages and interactions, it can balance these two properties together with channel-wise interaction diversity from data, rather than fixing the allocation through attention-head partitions. The nonlinear modulator and gate further enhance expressiveness, while their elementwise implementation around fixed graph aggregation preserves computational efficiency without explicit pairwise score evaluations. More details are provided in Section 4.1.1.
The empirical results support this design: I-FGMP-12 outperforms the compared fixed-computation neural decoders at all 18 operating points in Table 1, using fewer than 10.0% of their parameters and at most 80.0% of their FLOPs. The expanded evaluation on five medium- and long-length codes further shows that I-FGMP-Scale generally outperforms BP-100, with substantial BER improvements at higher Eb/N0 on most codes (Appendix F.2, Table 11). For example, on the longest code, LDPC$(1056,880)$, at 5.00 dB, its estimated BER is approximately 20.2% of BP-100's. Hardware measurements also demonstrate practical efficiency gains: on LDPC$(121,60)$ using an RTX 2080 Ti at B=1024, I-FGMP-12 achieves 1.91× and 1.20× the throughput of CrossMPT and EfficientMPT, respectively, while reducing peak allocated GPU memory by 79.0% and 36.7% (Appendix I, Table 13).
Response to W3, Q1:
We have added conventional BER and FER versus Eb/N0 curves for all eleven codes in Appendix H (Figures 5–8). Table 12 reports Eb/N0 gains over BP-100 at BER=10−4 and FER=10−3, estimated by linear interpolation in log error rate between adjacent positive samples, without extrapolation. I-FGMP-Scale achieves positive gains on every code at both reference rates, with median gains of 0.240 and 0.210 dB, respectively. The curve trends suggest that larger gains may be obtained at lower target BER and FER.
Due to limited time and computational resources, we have been unable to fully characterize the behavior in the waterfall and error-floor regions through simulations. We will make effort to obtain the corresponding simulation results after the rebuttal period.
Response to W4, W5:
The six short codes, including the MacKay code, follow the benchmarks used in the original neural-decoder papers, enabling direct comparison of decoding architectures on the same codes. We have also extended the evaluation to five medium- and long-length codes in Appendix F.2 (Tables 10–11), where I-FGMP-Scale generally outperforms BP-100 and shows substantial BER improvements at higher Eb/N0 on most codes.
We have also added comparisons with OSD of orders 1 and 2 on LDPC$(49,24),LDPC(648,540),andLDPC(1056,880)$ in Appendix G (Figure 4). OSD-2 achieves the lowest BER and FER on the short code. On both longer codes, I-FGMP-12 and I-FGMP-Scale achieve lower BER throughout the tested range and lower FER from 3.50 dB onward.
Appendix G also discusses complexity. At fixed code rate, hidden dimension, and iteration budget, I-FGMP costs O(n2) per frame with dense aggregation, or O(n) with sparse aggregation on bounded-degree graphs. Both compared OSD implementations use O(n3) dense elimination per frame to select the information set, in addition to candidate-search costs of O(n2) for OSD-1 and O(n3) for OSD-2. I-FGMP therefore has more favorable asymptotic scaling with block length than these implementations.