Hugging Face · Daily papersoff the list

N-Gram Memories at Two Bits: Quantizing Lookup Tables in Large Language Models

Conditional memory expands language-model capacity through selective lookup, but the full embedding table must remain available for every possible input. We introduce Conditional Program (CP), a compr

1 comments

Open on Hugging Face ↗Hugging Face Daily Papers: trending AI research

–Rank now

#18Best rank

–Score · 24h

47Score · 7d

2Days on list

5Snapshots

Oct 20, 2026First seen

Summary

N-Gram Memories at Two Bits: Quantizing Lookup Tables in Large Language Models was first seen on Hugging Face · Daily papers on Oct 20, 2026. Since then it appeared in 5 hourly checks across 2 days, peaking at #18 on Oct 21, 05:18 UTC. It was last on the list on Oct 21, 05:18 UTC.

Rank history

Position on Hugging Face · Daily papers at every check (lower is better).

Last 14 days

Best rank per day (UTC).

Oct 14today

Metric history

Platform metric as reported by Hugging Face.

Embed badge

Show that this trended, linking back to this page.

<a href="https://trendoday.com/hugging-face/papers/2610.21810-n-gram-memories-at-two-bits-quantizing-lookup-tables-in"><img src="https://trendoday.com/badge/hugging-face/papers/2610.21810-n-gram-memories-at-two-bits-quantizing-lookup-tables-in.svg" alt="N-Gram Memories at Two Bits: Quantizing Lookup Tables in Large Language Models on TrendBoard" height="44"></a>

[![N-Gram Memories at Two Bits: Quantizing Lookup Tables in Large Language Models on TrendBoard](https://trendoday.com/badge/hugging-face/papers/2610.21810-n-gram-memories-at-two-bits-quantizing-lookup-tables-in.svg)](https://trendoday.com/hugging-face/papers/2610.21810-n-gram-memories-at-two-bits-quantizing-lookup-tables-in)