Periodic RoPE schedules yield exactly LTL with past operators and modular predicates, while conventional non-periodic RoPE provides only a bounded, precision-limited fixed-offset look-back mechanism.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Disentangling the Expressivity of RoPE
Periodic RoPE schedules yield exactly LTL with past operators and modular predicates, while conventional non-periodic RoPE provides only a bounded, precision-limited fixed-offset look-back mechanism.