New verification connection from C-RASP to Lustre model checkers plus local search algorithm for synthesizing C-RASP programs from examples.
Counting like transformers: Compiling temporal counting logic into softmax transformers.CoRR, abs/2404.04393
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LG 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Hybrid Gated DeltaNet-Attention decoders solve parity-conditioned retrieval with O(1) scratchpad while pure Gated DeltaNet cannot and pure Gated Attention needs polynomial length.
citing papers explorer
-
Synthesis and Verification of Transformer Programs (Technical Report)
New verification connection from C-RASP to Lustre model checkers plus local search algorithm for synthesizing C-RASP programs from examples.
-
Provably Shorter Scratchpads in Hybrid DeltaNet-Attention Decoders
Hybrid Gated DeltaNet-Attention decoders solve parity-conditioned retrieval with O(1) scratchpad while pure Gated DeltaNet cannot and pure Gated Attention needs polynomial length.