78%Highly rated
?Highly ratedVote to see the score
Length Generalization for Transformers via Compression
Refining C-RASP via compressed strings yields polynomial transformer length generalization bounds for tasks with compressed-string solutions.
Paris Poster Session 5, Fri, Dec 11, 11:30 AM–1:30 PM, Paris Poster Hall · Published 2026
– ReadersNo votes yet
11/20 AI panelreviewers recommend it
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.
AI panel: 11 of 20 reviewers recommend it
lenient 2/5
medium 6/10
strict 3/5