Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Brian Lester

dblp:238/0436 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
7since 2021 · last 2025
0000-0002-4297-2508ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 7 · 1 first-author · 7 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
7 papers
Language models and text generation · 43% Efficient and distributed learning · 35% Transfer learning and domain adaptation · 22%
Software engineering, system software, and programming languages
1 paper
Requirements engineering and software design · 100%

Topics — the 14 heaviest of 15, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning
1.122022
SPoT: Better Frozen Model Adaptation through Soft Prompt Transfer · ACL (1) 2022
The Power of Scale for Parameter-Efficient Prompt Tuning · EMNLP (1) 2021
Natural language and speech › Language models and text generation
prompt tuning
1.122022
SPoT: Better Frozen Model Adaptation through Soft Prompt Transfer · ACL (1) 2022
The Power of Scale for Parameter-Efficient Prompt Tuning · EMNLP (1) 2021
Natural language and speech › Language models and text generation › large language model training › language model pretraining
large language model pretraining
0.912025
The Common Pile v0.1: An 8TB Dataset of Public Domain and Openly Licensed Text · NeurIPS 2025
Natural language and speech › Language models and text generation › large language model training › language model pretraining
pretraining data curation
0.912025
The Common Pile v0.1: An 8TB Dataset of Public Domain and Openly Licensed Text · NeurIPS 2025
Machine learning › Efficient and distributed learning › distributed training
distributed training systems
0.712023
Scaling Up Models and Data with t5x and seqio · J. Mach. Learn. Res. 2023
Machine learning › Efficient and distributed learning › large-scale learning
large-scale model training
0.712023
Scaling Up Models and Data with t5x and seqio · J. Mach. Learn. Res. 2023
Requirements engineering and software design › model-driven engineering
collaborative modeling
0.712023
Git-Theta: A Git Extension for Collaborative Development of Machine Learning Models · ICML 2023
Machine learning › Transfer learning and domain adaptation
cross-lingual transfer
0.612022
Overcoming Catastrophic Forgetting in Zero-Shot Cross-Lingual Generation · EMNLP 2022
Natural language and speech › Language models and text generation
instruction tuning
0.612022
Finetuned Language Models are Zero-Shot Learners · ICLR 2022
Machine learning › Transfer learning and domain adaptation › parameter-efficient transfer learning
prompt-based transfer
0.612022
SPoT: Better Frozen Model Adaptation through Soft Prompt Transfer · ACL (1) 2022
Machine learning › Transfer learning and domain adaptation
zero-shot learning
0.612022
Finetuned Language Models are Zero-Shot Learners · ICLR 2022
Natural language and speech › Language models and text generation
large language model
0.212023
Scaling Up Models and Data with t5x and seqio · J. Mach. Learn. Res. 2023
Natural language and speech › Language models and text generation
text summarization
0.212022
Overcoming Catastrophic Forgetting in Zero-Shot Cross-Lingual Generation · EMNLP 2022
Machine learning › Transfer learning and domain adaptation
cross-domain transfer
0.112021
The Power of Scale for Parameter-Efficient Prompt Tuning · EMNLP (1) 2021

Methods — techniques the papers use, named apart from their topics

version control · 1.3model merging · 1.3language model training · 0.9prompt tuning · 0.6parameter-efficient adaptation · 0.6instruction tuning · 0.6fine-tuning · 0.6soft prompts · 0.5prompt ensembling · 0.5backpropagation · 0.5
YearPublicationVenuePosition
2025 The Common Pile v0.1: An 8TB Dataset of Public Domain and Openly Licensed Text
abstract
Large language models (LLMs) are typically trained on enormous quantities of unlicensed text, a practice that has led to scrutiny due to possible intellectual property infringement and ethical concerns. Training LLMs on openly licensed text presents a first step towards addressing these issues, but prior data collection efforts have yielded datasets too small or low-quality to produce performant LLMs. To address this gap, we collect, curate, and release the Common Pile v0.1, an eight terabyte collection of openly licensed text designed for LLM pretraining. The Common Pile comprises content from 30 sources that span diverse domains including research papers, code, books, encyclopedias, educational materials, audio transcripts, and more. Crucially, we validate our efforts by training two 7 billion parameter LLMs on text from the Common Pile: Comma v0.1-1T and Comma v0.1-2T, trained on 1 and 2 trillion tokens respectively. Both models attain competitive performance to LLMs trained on unlicensed text with similar computational budgets, such as Llama 1 and 2 7B. In addition to releasing the Common Pile v0.1 itself, we also release the code used in its creation as well as the training mixture and checkpoints for the Comma v0.1 models.
Nikhil Kandpal, Brian Lester, Colin Raffel, Sebastian Majstorovic, Stella Biderman, Baber Abbasi, Luca Soldaini, Enrico Shippole, A. Feder Cooper, Aviya Skowron, Shayne Longpre, Lintang Sutawika, Alon Albalak, Zhenlin Xu, Guilherme Penedo, Loubna Ben Allal, Elie Bakouch, John David Pressman, Honglu Fan, Dashiell Stander, Guangyu Song, Aaron Gokaslan, John Kirchenbauer, Tom Goldstein, Brian R. Bartoldson, Bhavya Kailkhura, Tyler Murray
NeurIPS2
2023 Git-Theta: A Git Extension for Collaborative Development of Machine Learning Models
abstract
Currently, most machine learning models are trained by centralized teams and are rarely updated. In contrast, open-source software development involves the iterative development of a shared artifact through distributed collaboration using a version control system. In the interest of enabling collaborative and continual improvement of machine learning models (Raffel, 2023), we introduce Git-Theta, a version control system for machine learning models. Git-Theta is an extension to Git, the most widely used version control software, that allows fine-grained tracking of changes to model parameters alongside code and other artifacts. Unlike existing version control systems that treat a model checkpoint as a blob of data, Git-Theta leverages the structure of checkpoints to support communication-efficient updates, automatic model merges, and meaningful reporting about the difference between two versions of a model. In addition, Git-Theta includes a plug-in system that enables users to easily add support for new functionality. In this paper, we introduce Git-Theta’s design and features and include an example use-case of Git-Theta where a pre-trained model is continually adapted and modified. We publicly release Git-Theta in hopes of kickstarting a new era of collaborative model development. https://github.com/r-three/git-theta/
Nikhil Kandpal, Brian Lester, Mohammed Muqeeth, Anisha Mascarenhas, Monty Evans, Vishal Baskaran, Tenghao Huang, Haokun Liu, Colin Raffel
ICML2
2023 Scaling Up Models and Data with t5x and seqio
abstract
Scaling up training datasets and model parameters have benefited neural network-based language models, but also present challenges like distributed compute, input data bottlenecks and reproducibility of results. We introduce two simple and scalable software libraries that simplify these issues: t5x enables training large language models at scale, while seqio enables reproducible input and evaluation pipelines. These open-source libraries have been used to train models with hundreds of billions of parameters on multi-terabyte datasets. Configurations and instructions for T5-like and GPT-like models are also provided. The libraries can be found at https://github.com/google-research/t5x and https://github.com/google/seqio.
Adam Roberts, Hyung Won Chung, Anselm Levskaya, Daniel Andor, Sharan Narang, Brian Lester, Colin Gaffney, Afroz Mohiuddin, Curtis Hawthorne, Aitor Lewkowycz, Alex Salcianu, Marc van Zee, Jacob Austin, Sebastian Goodman, Livio B. Soares, Haitang Hu, Sasha Tsvyashchenko, Aakanksha Chowdhery, Jasmijn Bastings, Jannis Bulian, Xavier Garcia, Jianmo Ni, Kathleen Kenealy, Kehang Han, Michelle Casbon, Jonathan H. Clark, Stephan Lee, Dan Garrette, James Lee-Thorp, Colin Raffel, Noam Shazeer, Marvin Ritter, Maarten Bosma, Alexandre Tachard Passos, Jeremy Maitin-Shepard, Noah Fiedel, Mark Omernick, Brennan Saeta, Ryan Sepassi, Alexander Spiridonov, Joshua Newlan, Andrea Gesmundo
J. Mach. Learn. Res.8
2022 SPoT: Better Frozen Model Adaptation through Soft Prompt Transfer
abstract
There has been growing interest in parameter-efficient methods to apply pre-trained language models to downstream tasks. Building on the Prompt Tuning approach of Lester et al. (2021), which learns task-specific soft prompts to condition a frozen pre-trained model to perform different tasks, we propose a novel prompt-based transfer learning approach called SPoT: Soft Prompt Transfer. SPoT first learns a prompt on one or more source tasks and then uses it to initialize the prompt for a target task. We show that SPoT significantly boosts the performance of Prompt Tuning across many tasks. More remarkably, across all model sizes, SPoT matches or outperforms standard Model Tuning (which fine-tunes all model parameters) on the SuperGLUE benchmark, while using up to 27,000× fewer task-specific parameters. To understand where SPoT is most effective, we conduct a large-scale study on task transferability with 26 NLP tasks in 160 combinations, and demonstrate that many tasks can benefit each other via prompt transfer. Finally, we propose an efficient retrieval approach that interprets task prompts as task embeddings to identify similar tasks and predict the most transferable source tasks for a novel target task.
Tu Vu, Brian Lester, Noah Constant, Rami Al-Rfou, Daniel M. Cer
ACL (1)2
2022 Overcoming Catastrophic Forgetting in Zero-Shot Cross-Lingual Generation
abstract
In this paper, we explore the challenging problem of performing a generative task in a target language when labeled data is only available in English, using summarization as a case study.We assume a strict setting with no access to parallel data or machine translation and find that common transfer learning approaches struggle in this setting, as a generative multilingual model fine-tuned purely on English catastrophically forgets how to generate non-English.Given the recent rise of parameter-efficient adaptation techniques, we conduct the first investigation into how one such method, prompt tuning (Lester et al., 2021), can overcome catastrophic forgetting to enable zero-shot cross-lingual generation.Our experiments show that parameter-efficient prompt tuning provides gains over standard fine-tuning when transferring between lessrelated languages, e.g., from English to Thai.However, a significant gap still remains between these methods and fully-supervised baselines.To improve cross-lingual transfer further, we explore several approaches, including: (1) mixing in unlabeled multilingual data, and (2) explicitly factoring prompts into recombinable language and task components.Our approaches can provide further quality gains, suggesting that robust zero-shot crosslingual generation is within reach.ING and standard MODELTUNING for zero-shot cross-lingual generation (XGEN).We show that increasing model scale and decreasing tunable parameter capacity are key for overcoming catastrophic forgetting on XGEN.• We propose WIKILINGUA-0, a challenging XGEN benchmark and an associated SP-ROUGE evaluation metric, which we hope will facilitate future work evaluating multilingual summarization.• We show that mixing in unsupervised multilingual data can boost XGEN performance, and are the first to combine this approach with PROMPTTUNING.• We propose "factorized prompts", a novel approach that can also help PROMPTTUNING overcome severe catastrophic forgetting.• To facilitate future work, we release our data, pretrained models
Tu Vu, Aditya Barua, Brian Lester, Daniel M. Cer, Mohit Iyyer, Noah Constant
EMNLP3
2022 Finetuned Language Models are Zero-Shot Learners
Jason Wei, Maarten Bosma, Vincent Y. Zhao, Kelvin Guu, Adams Wei Yu, Brian Lester, Nan Du 0002, Andrew M. Dai, Quoc V. Le
ICLR6
2021 The Power of Scale for Parameter-Efficient Prompt Tuning
abstract
In this work, we explore "prompt tuning," a simple yet effective mechanism for learning "soft prompts" to condition frozen language models to perform specific downstream tasks.Unlike the discrete text prompts used by GPT-3, soft prompts are learned through backpropagation and can be tuned to incorporate signals from any number of labeled examples.Our end-to-end learned approach outperforms GPT-3's few-shot learning by a large margin.More remarkably, through ablations on model size using T5, we show that prompt tuning becomes more competitive with scale: as models exceed billions of parameters, our method "closes the gap" and matches the strong performance of model tuning (where all model weights are tuned).This finding is especially relevant because large models are costly to share and serve and the ability to reuse one frozen model for multiple downstream tasks can ease this burden.Our method can be seen as a simplification of the recently proposed "prefix tuning" of Li and Liang (2021) and we provide a comparison to this and other similar approaches.Finally, we show that conditioning a frozen model with soft prompts confers benefits in robustness to domain transfer and enables efficient "prompt ensembling."We release code and model checkpoints to reproduce our experiments.1
Brian Lester, Rami Al-Rfou, Noah Constant
EMNLP (1)1