Pith. sign in

REVIEW 2 cited by

SentenceVAE: Enable Next-sentence Prediction for Large Language Models with Faster Speed, Higher Accuracy and Longer Context

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.00655 v5 pith:43DHKGPQ submitted 2024-08-01 cs.AI cs.CL

classification cs.AIcs.CL
keywords inferencecontextllmssentencesentencevaespeedmethodprediction
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Current large language models (LLMs) primarily utilize next-token prediction method for inference, which significantly impedes their processing speed. In this paper, we introduce a novel inference methodology termed next-sentence prediction, aiming at enhancing the inference efficiency of LLMs. We present Sentence Variational Autoencoder (SentenceVAE), which includes a Sentence Encoder to compress multiple tokens in a sentence into a single token, and a Sentence Decoder to reconstruct it. By integrating SentenceVAE into the input and output layers of LLMs, we develop Sentence-level LLMs (SLLMs) that employ a sentence-by-sentence inference method. In addition, the SentenceVAE module of SLLMs can maintain the integrity of the original semantic content by segmenting the context into sentences, thereby improving accuracy while boosting inference speed. Moreover, compared to previous LLMs, SLLMs process fewer tokens over equivalent context length, significantly reducing memory demands for self-attention computation and facilitating the handling of longer context. Extensive experiments on Wanjuan dataset have revealed that the proposed method can accelerate inference speed by 204~365%, reduce perplexity (PPL) to 46~75% of its original metric, and decrease memory overhead by 86~91% for the equivalent context length, compared to previous token-by-token methods.

Discussion (0). Sign in 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. TAG-INSTRUCT: Controlled Instruction Complexity Enhancement through Structure-based Augmentation

    cs.CL 2025-05 conditional novelty 6.0 of 10

    Operating on compressed semantic tags instead of raw text gives more controllable and effective instruction complexity augmentation for LLM fine-tuning, with reported gains over Evol-Instruct, Tree-Instruct, Auto-Inst...

  2. Joint Lossless Compression and Steganography for Medical Images via Large Language Models

    eess.IV 2025-08 reject novelty 4.0 of 10

    A joint lossless compression and steganography framework for medical images that splits bit planes into a VAE-compressed global part and an LLM-compressed local part, embedding secret messages in the local part.

Pith tools