11 citations · 21 across the 7 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
cs.CL2024★ 1 cited
Just read twice: closing the recall gap for recurrent language models
Simran Arora, Aman Timalsina, Aaryan Singhal +6
Recurrent large language models that compete with Transformers in language modeling perplexity are emerging at a rapid rate (e.g., Mamba, RWKV). Excitingly, these architectures use…
math.AT2024
Computing Generalized Ranks of Persistence Modules via Unfolding to Zigzag Modules
Tamal K. Dey, Cheng Xin
For a -indexed persistence module , the (generalized) rank of is defined as the rank of the limit-to-colimit map for the diagram of vector spaces of …
cs.CL2024★ 4 cited
Simple linear attention language models balance the recall-throughput tradeoff
Simran Arora, Sabri Eyuboglu, Michael Zhang +6
Recent work has shown that attention-based language models excel at recall, the ability to ground generations in tokens previously seen in context. However, the efficiency of atten…