[KongchangAI]
ModelProVe-lossless

ProVe

An inference acceleration method that reverses the role assignment in speculative decoding. A large model is fine-tuned to act as the proposer, predicting multiple future tokens in a single forward pass, which are then verified with an additional forward pass, without requiring an extra draft head.

Timeline (last 90 days)

Oct 21

ProVe makes the large model itself the proposer, predicting multiple future tokens in one forward pass, then completing verification with one additional forward pass.

Unverified50%
Oct 21

ProVe achieves an average 2.5x throughput improvement on 32B models without training an additional draft head.

Unverified50%
Oct 21

On the GSM8K dataset, with a block size of 16, the average matched prefix length between ProVe proposal blocks and AR decoding is 6.6 tokens.

Unverified50%
Oct 21

When a 3B small verifier is introduced, ProVe reaches an average 2.7x throughput, but its average accuracy across six tasks is 2.6 percentage points lower than AR.

Unverified50%
Oct 21

ProVe is evaluated on six benchmarks using a 32B proposer.

Unverified50%
Oct 21

ProVe's core innovation is fine-tuning the large model itself into a proposer for block-level prediction, avoiding training an independent draft head and simplifying deployment.

Unverified50%
Oct 21

The small verifier (3B) is a lossy acceleration mode whose scoring criterion is not fully consistent with the proposer, potentially causing output distribution shift and accuracy degradation.

Unverified50%

All Facts (7)

Source Articles