Pith. sign in

REVIEW 1 cited by

Increasing transformer token length with a Maximum Entropy Principle Method

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 2408.10277 v1 pith:DVI3NDZG submitted 2024-08-17 cs.LG

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

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Transformers suffer from the computational overhead of their quadratic dependence on the length of sequences processed. We present three methods, all adding an intermediate step between training and inference/generation, which extend the autoregressive length of transformers. All rely on a Maximum Entropy Principle (MEP) whereby entropy is maximized in the presence of suitable constraints, accounted for by use of Lagrange Multipliers. These constraint methods extend the autoregressive character from T to 2T tokens in a linear-with-T fashion. There is overhead associated with this added step, but they should still be faster than the standard methods.

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. SpecRouter: Adaptive Routing for Multi-Level Speculative Decoding in Large Language Models

    cs.LG 2025-05 reject novelty 5.0 of 10

    SpecRouter dynamically schedules chains of draft and verifier models for multi-level speculative decoding, adding a mask-based rollback mechanism for key-value caches.

Pith tools