- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 3
Read review
Paper summary
The paper proposes a neural solver for decoding parity-check codes. The solver combines two main components: a message-passing network that acts on relaxed Boolean variables, and a more expensive Gaussian elimination component that handles deadlocks. The message-passing network is used to resolve most of the constraints, while elimination is applied only to the variables it fails to resolve. The approach is validated against belief propagation and algebraic elimination methods.
Critical strengths
-
The approach appears well-motivated, combining the scalability of continuous neural relaxations with the robustness of a more classical decoding method.
-
Allowing the xLoop component to be used independently of the proposed neural solver makes it more widely applicable to existing systems.
Critical weaknesses
-
The introduction could be tightened. The related work paragraph seems redundant, as it largely repeats work already cited earlier. I also found the 'core contributions' section too dense. It might be better to give a more concise summary of the model there, leaving the more technical terminology to subsequent sections.
-
Section 3 was difficult to follow. The latent state update described in Section 3.2 makes forward references to variables defined in subsequent sections without sufficiently explaining them when they first appear. More generally, the section describes how the model works, but does not adequately explain why it is designed this way, or the trade-offs between alternative designs.
-
The method is compared only against non-ML baselines. Experiments should ideally compare the solver's first two stages against some of the graph neural decoding methods described in the introduction to isolate the impact of this particular neural architecture.
-
Minor: it would be beneficial to include the latency scaling curves in the main paper, since Lotus's speedup is one of the headline results reported in the abstract.
Questions for authors
-
Have you considered alternative methods of aggregating node messages, such as attention or degree-normalized aggregation? How might this affect the model's performance?
-
How expensive is the xLoop stage of the solver compared to its first two stages?