Fetching the paper…
Reading the bibliography…
We provide new estimates of an asymptotic upper bound on the entropy of English using the large language model LLaMA-7B as a predictor for the next token given a window of past tokens.
“Prediction and entropy of printed english,”
Claude E Shannon, · 1951
Earlier work this paper cites.
“A convergent gambling estimate of the entropy of english,”
Thomas Cover and Roger King, · 1978
Earlier work this paper cites.
“Data compression using adaptive coding and partial string matching,”
John Cleary and Ian Witten, · 1984
Earlier work this paper cites.
“Modeling for text compression,”
Timothy Bell, Ian H Witten, and John G Cleary, · 1989
Earlier work this paper cites.
Elements of Information Theory
Thomas M Cover and Joy A Thomas, · 1999
Cited alongside, same era.
Information theory, inference and learning algorithms
David JC MacKay, · 2003
Cited alongside, same era.
“Deepzip: Lossless data compression using recurrent neural networks,”
Mohit Goyal, Kedar Tatwawadi, Shubham Chandak, and Idoia Ochoa, · 2018
Cited alongside, same era.
Taku Kudo and John Richardson, · 2018
Cited alongside, same era.
“text8 results,” http://mattmahoney.net/dc/textdata.html
Cited in the paper.
“Focus your attention (with adaptive IIR filters),” 2023
Shahar Lutati, Itamar Zimerman, and Lior Wolf, · 2023
Closest in time.
“Llama: Open and efficient foundation language models,” 2023
Hugo Touvron, Thibaut Lavril, Gautier Izacard, Xavier Martinet, Marie-Anne Lachaux, Timothée Lacroix, Baptiste Rozière, Naman Goyal, Eric Hambro, Faisal Azhar, Aurelien Rodriguez, Armand Joulin, Edouard Grave, and Guillaume Lample, · 2023
Closest in time.
Legends of Texas
J. Frank Dobie, · 2023
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…