dorsal/arxiv
View SchemaRewriteNets: End-to-End Trainable String-Rewriting for Generative Sequence Modeling
| Authors | Harshil Vejendla |
|---|---|
| Categories | |
| ArXiv ID | 2601.07868vv1 |
| URL | https://arxiv.org/abs/2601.07868 |
| License | http://creativecommons.org/licenses/by/4.0/ |
Abstract
Dominant sequence models like the Transformer represent structure implicitly through dense attention weights, incurring quadratic complexity. We propose RewriteNets, a novel neural architecture built on an alternative paradigm: explicit, parallel string rewriting. Each layer in a RewriteNet contains a set of learnable rules. For each position in an input sequence, the layer performs four operations: (1) fuzzy matching of rule patterns, (2) conflict resolution via a differentiable assignment operator to select non-overlapping rewrites, (3) application of the chosen rules to replace input segments with output segments of potentially different lengths, and (4) propagation of untouched tokens. While the discrete assignment of rules is non-differentiable, we employ a straight-through Gumbel-Sinkhorn estimator, enabling stable end-to-end training. We evaluate RewriteNets on algorithmic, compositional, and string manipulation tasks, comparing them against strong LSTM and Transformer baselines. Results show that RewriteNets excel at tasks requiring systematic generalization (achieving 98.7% accuracy on the SCAN benchmark's length split) and are computationally more efficient than Transformers. We also provide an analysis of learned rules and an extensive ablation study, demonstrating that this architecture presents a promising direction for sequence modeling with explicit structural inductive biases.
{
"annotation_id": "eb47d777-9b03-43ac-8c21-4c48039c682b",
"date_created": "2026-02-17T05:53:12.440000Z",
"date_modified": "2026-02-17T05:53:12.440000Z",
"file_hash": "7cf1df7a29f341554c606563025c2bc02dd1e45e0acf4c50b793d8354661177f",
"private": false,
"record": {
"abstract": "Dominant sequence models like the Transformer represent structure implicitly through dense attention weights, incurring quadratic complexity. We propose RewriteNets, a novel neural architecture built on an alternative paradigm: explicit, parallel string rewriting. Each layer in a RewriteNet contains a set of learnable rules. For each position in an input sequence, the layer performs four operations: (1) fuzzy matching of rule patterns, (2) conflict resolution via a differentiable assignment operator to select non-overlapping rewrites, (3) application of the chosen rules to replace input segments with output segments of potentially different lengths, and (4) propagation of untouched tokens. While the discrete assignment of rules is non-differentiable, we employ a straight-through Gumbel-Sinkhorn estimator, enabling stable end-to-end training. We evaluate RewriteNets on algorithmic, compositional, and string manipulation tasks, comparing them against strong LSTM and Transformer baselines. Results show that RewriteNets excel at tasks requiring systematic generalization (achieving 98.7% accuracy on the SCAN benchmark\u0027s length split) and are computationally more efficient than Transformers. We also provide an analysis of learned rules and an extensive ablation study, demonstrating that this architecture presents a promising direction for sequence modeling with explicit structural inductive biases.",
"arxiv_id": "2601.07868",
"authors": [
"Harshil Vejendla"
],
"categories": [
"cs.LG",
"cs.AI"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"title": "RewriteNets: End-to-End Trainable String-Rewriting for Generative Sequence Modeling",
"url": "https://arxiv.org/abs/2601.07868",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "7d791453-1cf0-4c20-a80f-c16fd24e8524",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}