File Download

There are no files associated with this item.

Supplementary

Conference Paper: How Many Pretraining Tasks Are Needed for In-Context Learning of Linear Regression?

TitleHow Many Pretraining Tasks Are Needed for In-Context Learning of Linear Regression?
Authors
Issue Date7-May-2024
Abstract

Transformers pretrained on diverse tasks exhibit remarkable in-context learning (ICL) capabilities, enabling them to solve unseen tasks solely based on input contexts without adjusting model parameters. In this paper, we study ICL in one of its simplest setups: pretraining a linearly parameterized single-layer linear attention model for linear regression with a Gaussian prior. We establish a statistical task complexity bound for the attention model pretraining, showing that effective pretraining only requires a small number of independent tasks. Furthermore, we prove that the pretrained model closely matches the Bayes optimal algorithm, i.e., optimally tuned ridge regression, by achieving nearly Bayes optimal risk on unseen tasks under a fixed context length. These theoretical findings complement prior experimental research and shed light on the statistical foundations of ICL


Persistent Identifierhttp://hdl.handle.net/10722/348203

 

DC FieldValueLanguage
dc.contributor.authorWu, Jingfeng-
dc.contributor.authorZou, Difan-
dc.contributor.authorChen, Zixiang-
dc.contributor.authorBraverman, Vladimir-
dc.contributor.authorGu, Quanquan-
dc.contributor.authorBartlett, Peter L-
dc.date.accessioned2024-10-08T00:30:57Z-
dc.date.available2024-10-08T00:30:57Z-
dc.date.issued2024-05-07-
dc.identifier.urihttp://hdl.handle.net/10722/348203-
dc.description.abstract<p>Transformers pretrained on diverse tasks exhibit remarkable in-context learning (ICL) capabilities, enabling them to solve unseen tasks solely based on input contexts without adjusting model parameters. In this paper, we study ICL in one of its simplest setups: pretraining a linearly parameterized single-layer linear attention model for linear regression with a Gaussian prior. We establish a statistical task complexity bound for the attention model pretraining, showing that effective pretraining only requires a small number of independent tasks. Furthermore, we prove that the pretrained model closely matches the Bayes optimal algorithm, i.e., optimally tuned ridge regression, by achieving nearly Bayes optimal risk on unseen tasks under a fixed context length. These theoretical findings complement prior experimental research and shed light on the statistical foundations of ICL<br></p>-
dc.languageeng-
dc.relation.ispartofThe Twelfth International Conference on Learning Representations (ICLR) (07/05/2024-11/05/2024, Vienna)-
dc.titleHow Many Pretraining Tasks Are Needed for In-Context Learning of Linear Regression? -
dc.typeConference_Paper-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats