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

Tai Nakamaki

dblp:386/2237 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 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
1 paper
Learning theory · 67% Language models and text generation · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory › generalization
generalization analysis
0.812024
Transformers are Minimax Optimal Nonparametric In-Context Learners · NeurIPS 2024
Natural language and speech › Language models and text generation
in-context learning
0.812024
Transformers are Minimax Optimal Nonparametric In-Context Learners · NeurIPS 2024
Machine learning › Learning theory
nonparametric regression
0.812024
Transformers are Minimax Optimal Nonparametric In-Context Learners · NeurIPS 2024

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

besov space analysis · 0.8approximation theory · 0.8
YearPublicationVenuePosition
2024 Transformers are Minimax Optimal Nonparametric In-Context Learners
abstract
In-context learning (ICL) of large language models has proven to be a surprisingly effective method of learning a new task from only a few demonstrative examples. In this paper, we shed light on the efficacy of ICL from the viewpoint of statistical learning theory. We develop approximation and generalization error analyses for a transformer model composed of a deep neural network and one linear attention layer, pretrained on nonparametric regression tasks sampled from general function spaces including the Besov space and piecewise $\gamma$-smooth class. In particular, we show that sufficiently trained transformers can achieve -- and even improve upon -- the minimax optimal estimation risk in context by encoding the most relevant basis representations during pretraining. Our analysis extends to high-dimensional or sequential data and distinguishes the \emph{pretraining} and \emph{in-context} generalization gaps, establishing upper and lower bounds w.r.t. both the number of tasks and in-context examples. These findings shed light on the effectiveness of few-shot prompting and the roles of task diversity and representation learning for ICL.
Juno Kim, Tai Nakamaki, Taiji Suzuki
NeurIPS2