arXiv CS
open access
BitMTP: When Multi-Token Prediction Meets Low-Bit Large Language Models
For efficient deployment of large language models (LLMs), methods of ultra-low-bit backbones reduce weight storage, memory traffic, and linear-layer execution cost, while multi-token prediction (MTP) methods reduce sequential decoding steps by predicting multiple future tokens in parallel. Although
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Adaptive Multi-Token Prediction: How far should we go?#1394224
- Match the Distribution, Not the Compute: Post-Training Multi-Token Prediction Heads#1155823
- When Entropy Is Not Enough: Reclaiming Lost Semantics in LLM Output Length Prediction#1401004
- Beneath the Tokens: A Performance Engineering Study of Multi-Token Prediction in GPU-Accelerated LLM Inference#1129785
- The Cost of Context: Profiling the Energy Footprint of Input Tokens in Large Language Models#1354502
Record · ID 1394207
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive