Skip to content
OpenTrain AIFor AI Companies

HFEPX · Eval paper review

Structural Generalization on SLOG without Hand-Written Rules

Zichao Wei

Published

Apr 28, 2026

Citations

0

Trust level

Low

Usefulness score

0/100 (Low)

Extraction confidence

35% (Low)

Derived from extracted protocol signals and abstract evidence.

Rater population

Not reported

Signals refreshed

May 8, 2026

Open arXiv Find implementation Shortlist (0) RSS feed

Tags

Automatic Metrics

Should you rely on this paper?

This paper is adjacent to HFEPX scope and is best used for background context, not as a primary protocol reference.

Use this as background context only. Do not make protocol decisions from this page alone.

Best use

Background context only

Use if you need

A secondary eval reference to pair with stronger protocol papers.

What to verify

Validate the evaluation procedure and quality controls in the full paper before operational use.

Main weakness

This paper looks adjacent to evaluation work, but not like a strong protocol reference.

Human feedback signal
Not explicit
Not explicit in abstract metadata
Evaluation signal
Detected
Eval setup described
Usefulness for eval research
0/100
Adjacent candidate

Treat as adjacent context, not a core eval-method reference.

If you are doing eval pipeline work, start here

Human Eval Papers LLM-as-Judge Papers Pairwise Preference Papers Tool-Use Evaluation Search

Abstract

Structural generalization in semantic parsing requires systems to apply learned compositional rules to novel structural combinations. Existing approaches either rely on hand-written algebraic rules (AM-Parser) or fail to generalize structurally (Transformer-based models). We present an alternative requiring no hand-written compositional rules, based on a neural cellular automaton (NCA) with a discrete bottleneck: all compositional rules are learned from data through local iteration. On the SLOG benchmark, the system achieves an overall accuracy of $67.3 \pm 0.2\%$ across 10 seeds (AM-Parser: $70.8 \pm 4.3\%$), with 11 of 17 structural generalization categories at $100\%$ type-exact match, including three where AM-Parser scores $0$--$74\%$. Analysis reveals that all 5,539 failure instances reduce to exactly two mechanisms: novel combinations of wh-extraction context with reduced verb types, and modifiers appearing on the subject side of verbs. When we decompose results by CCG structural features, each sub-pattern either succeeds on all instances or fails on all. Intermediate scores (e.g., $41.4\%$) are mixtures of structurally distinct CCG patterns, not partial generalization. These results suggest that CCG directed types provide higher resolution than SLOG's phenomenon-level categories for characterizing structural generalization, and that the success/failure boundary is determined by the coverage of directed operations in the training data.

What we could verify

These are the protocol signals we could actually recover from the available paper metadata. Use them to decide whether this paper is worth deeper reading.

Human Feedback Types

missing

None explicit

No explicit feedback protocol extracted.

"Structural generalization in semantic parsing requires systems to apply learned compositional rules to novel structural combinations."

Evaluation Modes

partial

Automatic Metrics

Includes extracted eval setup.

"Structural generalization in semantic parsing requires systems to apply learned compositional rules to novel structural combinations."

Quality Controls

missing

Not reported

No explicit QC controls found.

"Structural generalization in semantic parsing requires systems to apply learned compositional rules to novel structural combinations."

Benchmarks / Datasets

missing

Not extracted

No benchmark anchors detected.

"Structural generalization in semantic parsing requires systems to apply learned compositional rules to novel structural combinations."

Reported Metrics

partial

Accuracy, Exact match

Useful for evaluation criteria comparison.

"On the SLOG benchmark, the system achieves an overall accuracy of $67.3 \pm 0.2\%$ across 10 seeds (AM-Parser: $70.8 \pm 4.3\%$), with 11 of 17 structural generalization categories at $100\%$ type-exact match, including three where AM-Parser scores $0$--$74\%$."

Benchmarks and datasets

No benchmark or dataset names were extracted from the available abstract.

Reported metrics

accuracyexact match
Human feedback details
Uses human feedback
No
Feedback types
None
Rater population
Not reported
Expertise required
General
Evaluation details
Evaluation modes
Automatic Metrics
Agentic eval
None
Quality controls
Not reported
Evidence quality
Low
Use this page as
Background context only

Research brief

Metadata summary

Structural generalization in semantic parsing requires systems to apply learned compositional rules to novel structural combinations.

Based on abstract + metadata only. Check the source paper before making high-confidence protocol decisions.

Key takeaways

  • Structural generalization in semantic parsing requires systems to apply learned compositional rules to novel structural combinations.
  • Existing approaches either rely on hand-written algebraic rules (AM-Parser) or fail to generalize structurally (Transformer-based models).
  • We present an alternative requiring no hand-written compositional rules, based on a neural cellular automaton (NCA) with a discrete bottleneck: all compositional rules are learned from data through local iteration.

Researcher actions

  • Compare this paper against nearby papers in the same arXiv category before using it for protocol decisions.
  • Validate inferred eval signals (Automatic metrics) against the full paper.
  • Use related-paper links to find stronger protocol-specific references.

Caveats

  • Generated from abstract + metadata only; no PDF parsing.
  • Signals below are heuristic and may miss details reported outside the abstract.

Recommended queries

Accuracy

Contribution summary

  • We present an alternative requiring no hand-written compositional rules, based on a neural cellular automaton (NCA) with a discrete bottleneck: all compositional rules are learned from data through local iteration.
  • On the SLOG benchmark, the system achieves an overall accuracy of 67.3 \pm 0.2\% across 10 seeds (AM-Parser: 70.8 \pm 4.3\%), with 11 of 17 structural generalization categories at 100\% type-exact match, including three where AM-Parser…

Why it matters for eval

  • On the SLOG benchmark, the system achieves an overall accuracy of 67.3 \pm 0.2\% across 10 seeds (AM-Parser: 70.8 \pm 4.3\%), with 11 of 17 structural generalization categories at 100\% type-exact match, including three where AM-Parser…

Researcher checklist

  • Human feedback protocol is explicit

    No explicit human feedback protocol detected.

  • Evaluation mode is explicit

    Detected: Automatic Metrics

  • Quality control reporting appears

    No calibration/adjudication/IAA control explicitly detected.

  • Benchmark or dataset anchors are present

    No benchmark/dataset anchor extracted from abstract.

  • Metric reporting is present

    Detected: accuracy, exact match