Pith. sign in

REVIEW 2 cited by

TokenFormer: Rethinking Transformer Scaling with Tokenized Model Parameters

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.23168 v2 pith:TH4KK6IL submitted 2024-10-30 cs.LG

classification cs.LG
keywords modelparameterstokensmodelsscalingscratchtokenformertransformers
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Transformers have become the predominant architecture in foundation models due to their excellent performance across various domains. However, the substantial cost of scaling these models remains a significant concern. This problem arises primarily from their dependence on a fixed number of parameters within linear projections. When architectural modifications (e.g., channel dimensions) are introduced, the entire model typically requires retraining from scratch. As model sizes continue growing, this strategy results in increasingly high computational costs and becomes unsustainable. To overcome this problem, we introduce TokenFormer, a natively scalable architecture that leverages the attention mechanism not only for computations among input tokens but also for interactions between tokens and model parameters, thereby enhancing architectural flexibility. By treating model parameters as tokens, we replace all the linear projections in Transformers with our token-parameter attention layer, where input tokens act as queries and model parameters as keys and values. This reformulation allows for progressive and efficient scaling without necessitating retraining from scratch. Our model scales from 124M to 1.4B parameters by incrementally adding new key-value parameter pairs, achieving performance comparable to Transformers trained from scratch while greatly reducing training costs. Code and models are available at https://github.com/Haiyang-W/TokenFormer.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Improving Progressive Generation with Decomposable Flow Matching

    cs.CV 2025-06 conditional novelty 6.0 of 10

    DFM applies flow matching with per-stage noise schedules to Laplacian pyramid levels in one shared DiT, improving FID and FDD on ImageNet and video benchmarks over prior progressive generation baselines.

  2. Decoupling Knowledge and Reasoning in Transformers: A Modular Architecture with Generalized Cross-Attention

    cs.LG 2025-01 reject novelty 3.0 of 10

    The paper claims feed-forward networks are a special case of its proposed generalized cross-attention to a shared knowledge base, but the derivation is a tautology and no experiments are run.

Pith tools