Sign inGet started
Paper · arXiv

Compute-Optimal Pretrain--Fine-tune in Ridge Gradient Descent

Pretraining followed by fine-tuning introduces a compute-allocation problem: under a fixed training budget, compute spent improving the upstream objective reduces the compute available for downstream adaptation. Despite its practical importance, this trade-off is not yet well understood theoretically, even in simple models. In this paper, we cast this allocation as a compute-split problem under a two-stage pretrain--fine-tune procedure with fixed total optimisation budget, using regularised least squares trained by gradient descent as a tractable setting. We characterise the optimal split under data-dependent evaluation geometries induced by the fine-tuning problem. Our results show that ...

AuthorsAlex Buna, Fanghui Liu, Patrick Rebeschini
Primary categorystat.ML
Published14 September 2026
Last updated at source14 September 2026
stat.MLcs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/92ba27f2-c175-4302-8861-14f53132f0d9" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.