- Rating
- 1
- Confidence
- 1
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper proposes a post-training framework for llada 2.1 to enable it to perform Levenshtein editing, including operations like insertion and deletion. It has two key designs: the first is to use the longest common substring (LCS) algorithm to construct the label for edit supervision; the second is the multi-stage training to let the model revise its own errors. Experiments demonstrate the performance and efficiency superiority over llada 2.1 on standard benchmarks.
Critical strengths
-
This paper proposes an innovative solution to enable Levenshtein editing in DLMs, based on LCS labeling and multi-stage training.
-
Compared to llada 2.1, which is one of the most advanced SOTA DLMs, LED improves the generation accuracy and speed on various language benchmarks.
Critical weaknesses
This paper has substantial overlap with llada 2.2, which is a concurrent TMLR submission (https://openreview.net/forum?id=kTa5ZayvmJ), the shared mechanisms include deletion and insertion control tokens, insertion of a mask before the current token, fixed-length restoration through padding or truncation, LCS-derived supervision assigning at most one insertion per gap to the following matched anchor, and multi-stage training to revise the model-generated errors. See ICLR §§3.1–3.2 and Algorithms 1–2, and TMLR §3.1. The mechanisms are central to both papers, and neither supplied manuscript explicitly acknowledges the other.
This raises concerns about potential dual submission or unattributed reuse.
Questions for authors
NA
Response to Reviewer F7Hw: Relationship with LLaDA2.2
Thank you for pointing out the overlap with [LLaDA2.2] (https://openreview.net/forum?id=kTa5ZayvmJ). We acknowledge that LLaDA2.2 directly incorporates the LED algorithm studied in this submission and that the two manuscripts are under review concurrently. We agree that this relationship should have been made explicit. We will cite LLaDA2.2 and clarify the shared mechanism and the contributions of each paper in the revised manuscript.
Although the core editing mechanism is shared, the manuscripts address different research questions and provide distinct contributions:
Research objectives. LLaDA2.2 describes the development and evaluation of an agentic diffusion model. Our submission studies LED as an editing algorithm, focusing on its motivation, design, and ability to address sequence misalignment that replacement-only editing struggles to correct.
Methodological specification. LLaDA2.2 describes the insertion/deletion interface and LCS-based supervision. Our submission explicitly specifies training trajectory construction, mixed teacher forcing, the stage-wise loss, and cycle detection and resampling (§3.2;§3.3;§3.4; Algorithms 2–4). These procedures are not detailed in the LLaDA2.2 report.
Additional empirical findings. On a 16B model, we study controlled omission and duplication repair (Fig. 1; App. A.2), confidence-free decoding and pass@k solution coverage (§4.3–4.4; Figs. 3–4), and robustness when decoding blocks exceed the training block size (§4.6; Table 2). These analyses complement LLaDA2.2’s model-level benchmarks and editing ablation by examining LED’s behavior under controlled error and decoding settings.
We believe these focused methodological and empirical contributions make the manuscripts sufficiently distinct that their concurrent submission does not constitute prohibited dual submission.