New superword tokens algorithm drops the context overhead, saving tokens at COLM 2026
yuvalpi · x · 2026-10-07
Responding to skepticism that superword tokens are impractical and slow, the authors show their new algorithm eliminates the need to keep contexts. Work with Craig Schmidt and Chris Tanner (Kensho, Ben-Gurion University), presented as poster #139 at COLM 2026.
Related event: New Algorithm Frees Superword Tokens from Context Cache at COLM 2026(2 posts)→
More from Research
- HAIPS@COLM 2026 workshop on human-centered LM privacy and security opens call for papers — tianshi_li · 2026-10-07
- Podcast: a distinctive meaning makes sentences memorable, new language memory research — GretaTuckute · 2026-10-07
- CUAWright: Terminal-Only Computer-Use Agent Beats GUI Harnesses, Cuts Cost 37.5% — ysu_nlp · 2026-10-07
- AI's Top 10 papers list: Rulin Shao lands two first-author picks — ShayneRedford · 2026-10-07
- Paradigm evals its math model across 7 hard benchmarks, releases full eval suite — tensorqt · 2026-10-07
- Paradigm: post-training gains hinge on combining procedural and LLM-based synthetic data — tensorqt · 2026-10-07