1 problem

Matching

C-RASP length-generalization conjecture and sample-size bounds
Determine asymptotically tight worst-case sample-size bounds for length generalization by transformers whose solutions are expressible in the fragments $\mathsf{C\text{-}RASP}_{+}$ …
claimed progressformal-languages machine-learning-theory theoretical-computer-science
03

C-RASP length-generalization conjecture and sample-size bounds