- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper introduces SemDraft, which recovers executable pattern-editing programs from before-and-after sewing patterns without observing editing histories. A bounded search operates over nine semantic editing actions implemented by a deterministic compiler. Recovered programs undergo recompilation, ordering checks, and independent replay, and the resulting programs and dependency DAGs provide supervision for an action-ranking model. In a fixed search framework, the learned ranker achieves higher certified success than heuristic, random, and template-based rankings on synthetic, order-sensitive evaluation sets. The main result is an average of 63/80 certified cases, compared with 51/80 for the heuristic and 53/80 for template lookup.
Critical strengths
-
Recovering executable edits is a useful problem formulation. The paper goes beyond generating a final pattern and asks how one pattern can be transformed into another through semantic operations. This is particularly relevant when actions jointly affect panels, seams, and attached components. The distinction between reaching a similar endpoint, replaying an executable program, and establishing which actions can be reordered gives the problem more substance than geometric reconstruction alone.
-
The main ranking comparison is reasonably well controlled. Candidate generation, search framework, stopping criterion, and certification are held fixed rather than changing together with the learned component. The improvement also repeats on a second draw: 64 certified cases for the learned prior versus 52 for the heuristic and 51 for template lookup. This supports a real benefit from the learned ranking within the specified environment, rather than an advantage attributable only to different search machinery. 33799_Learning_to_Search_for_E
Critical weaknesses
-
The experiments do not yet establish the value of the distinctive learning contribution. DAG supervision gives 63 cases versus 61 for linear imitation on the main test, within the variation across training seeds; on the replication draw both reach 64. Meanwhile, all corpora come from a generator whose action-type sequences are largely determined by tier and depth. The evidence therefore supports learned ranking over this controlled distribution, but not a meaningful advantage from learning the certified partial-order structure. The certificate may still be valuable as an output artifact or training-data filter, but those roles need to be separated from the claimed learning benefit. This matters because the paper otherwise remains close to a domain-specific demonstration of search distillation.
-
The scope of the dependency certificate is not sufficiently established in Section 3.2. Each action pair is reportedly decided once and cached after being examined at a shared prefix. For state-dependent actions, commutativity at one prefix does not by itself establish commutativity at other reachable prefixes. The subsequent enumeration of linear orders and materialization of downward-closed subsets may address this, but the description does not make clear whether every permitted ordering is checked, or whether one representative state is retained for each completed-action set. This distinction is consequential: the DAG determines which next actions are labeled valid during training. A soundness argument tied to the actual caching and enumeration procedure is needed.
Questions for authors
-
What incremental benefit is attributable to full partial-order certification, beyond training on executable, replay-validated linear programs? The existing DAG-versus-linear comparison addresses the supervision format but does not separate the contribution of the certification filter. A targeted comparison using the existing recovered programs would help establish the role of this component.
-
Is a commutativity verdict cached per action pair, or per action pair and prefix state? Does certification verify the endpoint of every topological ordering admitted by the DAG? If the guarantee instead relies on complete static read/write effects, please state the required assumptions and explain why they cover the state-dependent template operations.