{
    "author": null,
    "date_published": "2026-09-14T00:00:00.000Z",
    "dek": null,
    "direction": "ltr",
    "domain": "arxiv.org",
    "excerpt": "Ternary Large Language Models (LLM) store every weight as one of three symbols $\\{-1,0,+1\\}$, so the cost of a ternary model is conventionally referenced to the information-theoretic $\\log_2 3 \\approx…",
    "lead_image_url": null,
    "next_page_url": null,
    "rendered_pages": 1,
    "title": "Breaking the 1.58-bit Barrier for Ternary LLMs",
    "total_pages": 1,
    "url": "https://arxiv.org/abs/2609.16338",
    "word_count": 281
}