Pith. sign in

REVIEW 1 cited by

MoDification: Mixture of Depths Made Easy

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.14268 v1 pith:VNXL62A7 submitted 2024-10-18 cs.CL cs.LG

classification cs.CLcs.LG
keywords llmsmodificationdepthsefficiencylatencylong-contextmemorymixture
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Long-context efficiency has recently become a trending topic in serving large language models (LLMs). And mixture of depths (MoD) is proposed as a perfect fit to bring down both latency and memory. In this paper, however, we discover that MoD can barely transform existing LLMs without costly training over an extensive number of tokens. To enable the transformations from any LLMs to MoD ones, we showcase top-k operator in MoD should be promoted to threshold-p operator, and refinement to architecture and data should also be crafted along. All these designs form our method termed MoDification. Through a comprehensive set of experiments covering model scales from 3B to 70B, we exhibit MoDification strikes an excellent balance between efficiency and effectiveness. MoDification can achieve up to ~1.2x speedup in latency and ~1.8x reduction in memory compared to original LLMs especially in long-context applications.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. ZigZagkv: Dynamic KV Cache Compression for Long-context Modeling based on Layer Uncertainty

    cs.CL 2024-12 conditional novelty 5.0 of 10

    A layer-uncertainty-based budget allocator for KV cache compression slightly outperforms uniform-budget and pyramid-budget baselines on LongBench and Needle-in-a-Haystack.

Pith tools