Papers › Should We Be Pre-training? An Argument for End-task Aware Training as an Alternative

Should We Be Pre-training? An Argument for End-task Aware Training as an Alternative

15 Sep 2021ICLR 2022 4arXiv:2109.07437archive 2025-07-28

Lucio M. Dery, Paul Michel, Ameet Talwalkar, Graham Neubig

In most settings of practical concern, machine learning practitioners know in advance what end-task they wish to boost with auxiliary tasks. However, widely used methods for leveraging auxiliary data like pre-training and its continued-pretraining variant are end-task agnostic: they rarely, if ever, exploit knowledge of the target task. We study replacing end-task agnostic continued training of pre-trained language models with end-task aware training of said models. We argue that for sufficiently important end-tasks, the benefits of leveraging auxiliary data in a task-aware fashion can justify forgoing the traditional approach of obtaining generic, end-task agnostic representations as with (continued) pre-training. On three different low-resource NLP tasks from two domains, we demonstrate that multi-tasking the end-task and auxiliary objectives results in significantly better downstream task performance than the widely-used task-agnostic continued pre-training paradigm of Gururangan et al. (2020). We next introduce an online meta-learning algorithm that learns a set of multi-task weights to better balance among our multiple auxiliary objectives, achieving further improvements on end-task performance and data efficiency.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2109.07437")

Code

Syntology Ran 0 of 7 code samples harvested from 1 repository linked to this paper; 7 have no recorded run.

By repository: official repository: 7 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

ldery/tartan officialmentioned in paperpytorchMIT report
ldery/automating-auxiliary-learning mentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

7 samples harvested; 0 ran; 0 honoured the contract we drafted; 7 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

7unverified

Licence: 0 of the 7 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from ldery/tartan. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

calc_norm ldery/tartan/simple_vision_tartan/tartan_utils.py official repository unverified MIT (permissive) · 9d6a95b950631903 · report
cosine ldery/tartan/simple_vision_tartan/tartan_utils.py official repository unverified MIT (permissive) · c54b69f5721172e3 · report
dot_prod ldery/tartan/simple_vision_tartan/tartan_utils.py official repository unverified MIT (permissive) · 6502cf86619c912c · report
get_model ldery/tartan/simple_vision_tartan/run_tartan.py official repository unverified MIT (permissive) · 5619edddef62bb1e · report
get_optimizer ldery/tartan/simple_vision_tartan/run_tartan.py official repository unverified MIT (permissive) · 0b1b624b8ddb1e3b · report
set_random_seed ldery/tartan/simple_vision_tartan/run_tartan.py official repository unverified MIT (permissive) · 20afabbb41adfa6e · report
to_tensor ldery/tartan/simple_vision_tartan/data.py official repository unverified MIT (permissive) · 2ddbc2d5391caae1 · report

Tasks

Meta-Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

AWARE

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections