Pith. sign in

REVIEW 3 cited by

Approximating Human-Like Few-shot Learning with GPT-based Compression

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 2308.06942 v1 pith:F3LTVFJP submitted 2023-08-14 cs.AI cs.CLcs.ITmath.IT

classification cs.AIcs.CLcs.ITmath.IT
keywords compressioninformationlearningtextdistancemodelsachievesapproximate
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this work, we conceptualize the learning process as information compression. We seek to equip generative pre-trained models with human-like learning capabilities that enable data compression during inference. We present a novel approach that utilizes the Generative Pre-trained Transformer (GPT) to approximate Kolmogorov complexity, with the aim of estimating the optimal Information Distance for few-shot learning. We first propose using GPT as a prior for lossless text compression, achieving a noteworthy compression ratio. Experiment with LLAMA2-7B backbone achieves a compression ratio of 15.5 on enwik9. We justify the pre-training objective of GPT models by demonstrating its equivalence to the compression length, and, consequently, its ability to approximate the information distance for texts. Leveraging the approximated information distance, our method allows the direct application of GPT models in quantitative text similarity measurements. Experiment results show that our method overall achieves superior performance compared to embedding and prompt baselines on challenging NLP tasks, including semantic similarity, zero and one-shot text classification, and zero-shot text ranking.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Separate Source Channel Coding Is Still What You Need: An LLM-based Rethinking

    cs.IT 2025-01 conditional novelty 6.0 of 10

    LLM-based arithmetic coding plus ECCT-enhanced LDPC decoding makes separate source and channel coding competitive with, and in these tests superior to, joint source-channel coding for text under a total-energy comparison.

  2. An Enhanced Text Compression Approach Using Transformer-based Language Models

    cs.CL 2024-12 reject novelty 3.0 of 10

    Removing vowels before LZW compression yields high compression ratios, but the resulting text cannot be restored without a large transformer, making the claimed state-of-the-art comparison unfair.

  3. Assessing GPT Model Uncertainty in Mathematical OCR Tasks via Entropy Analysis

    cs.IT 2024-12 reject novelty 3.0 of 10

    The paper reports that GPT-4o's token-level uncertainty, computed as the negative log-likelihood of its output, rises monotonically as image resolution falls from 300 to 72 dpi on a single test page.

Pith tools