Methods › Natural Language Processing › Language Models › BLOOM › Papers, page 2
BLOOM
Papers archive 2025-07-28
archive papers tagged: 116 · with a code link: 51 · where Syntology ran a sample: 18 (15 with a run with no instrument failure, 3 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (18 of 116 tagged: 15 with a run with no instrument failure, 3 where every run was a failure of Syntology's instrument)
Page 2 of 2: papers 101 to 116 of 116, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
Understanding the Effectiveness of Very Large Language Models on Dialog Evaluation 27 Jan 2023 · 0 repositories · arXiv:2301.12004
-
Capacity Analysis of Vector Symbolic Architectures 24 Jan 2023 · 0 repositories · arXiv:2301.10352
-
Shades of Iteration: from Elgot to Kleene 15 Jan 2023 · 0 repositories · arXiv:2301.06202
-
There is No Big Brother or Small Brother: Knowledge Infusion in Language Models for Link Prediction and Question Answering 10 Jan 2023 · 2 repositories · arXiv:2301.04013
-
InPars-Light: Cost-Effective Unsupervised Training of Efficient Rankers 8 Jan 2023 · 0 repositories · arXiv:2301.02998
-
Maximizing Use-Case Specificity through Precision Model Tuning 29 Dec 2022 · 0 repositories · arXiv:2212.14206
-
BLOOM+1: Adding Language Support to BLOOM for Zero-Shot Prompting 19 Dec 2022 · 1 repository · arXiv:2212.09535
-
The case for 4-bit precision: k-bit Inference Scaling Laws 19 Dec 2022 · 1 repository · arXiv:2212.09720
-
Plansformer: Generating Symbolic Plans using Transformers 16 Dec 2022 · 0 repositories · arXiv:2212.08681
-
A Critical Analysis of Classifier Selection in Learned Bloom Filters 28 Nov 2022 · 1 repository · arXiv:2211.15565
-
Understanding BLOOM: An empirical study on diverse NLP tasks 27 Nov 2022 · 0 repositories · arXiv:2211.14865
-
SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Models 18 Nov 2022 · 5 repositories · arXiv:2211.10438Syntology official: harvested, nothing ran · 0 ran · 5 unverified (of 5 harvested samples)
-
Galactica: A Large Language Model for Science 16 Nov 2022 · 1 repository · arXiv:2211.09085Syntology official (archive's flag): 2 ran · 2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 2 harvested samples)
-
Evaluating the Factual Consistency of Large Language Models Through News Summarization 15 Nov 2022 · 1 repository · arXiv:2211.08412
-
On the Compositional Generalization Gap of In-Context Learning 15 Nov 2022 · 0 repositories · arXiv:2211.08473
-
BLOOM: A 176B-Parameter Open-Access Multilingual Language Model 9 Nov 2022 · 7 repositories · arXiv:2211.05100Syntology 2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 9 unverified (of 11 harvested samples)