LLaMA-2: Open Foundation and Fine-Tuned Chat Models
A Convergent Gambling Estimate Of The Entropy Of English
https://arxiv.org/abs/2305.14952
About the Test Data
Large language models and the entropy of English
Estimating and Comparing Entropy across Written Natural Languages Using PPM Compression
Calculating Kolmogorov complexity from the output frequency distributions of small Turing machines
Text Compression as a Test for Artificial Intelligence
Compression Represents Intelligence Linearly
Language Modeling Is Compression
Training LLMs over Neurally Compressed Text
LLMLingua: Compressing Prompts for Accelerated Inference of Large Language Models
Fast Text Compression with Neural Networks