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

Valérie Castin

dblp:365/8552 · DBLP profile ↗
← Back
1ranked-venue papers
1as 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 first-author · 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
Deep learning architectures and training · 50% Trustworthy machine learning · 25% Learning theory · 25%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory
lipschitz constant
0.812024
How Smooth Is Attention? · ICML 2024
Machine learning › Trustworthy machine learning
robustness
0.812024
How Smooth Is Attention? · ICML 2024
Machine learning › Deep learning architectures and training › attention mechanism
self-attention
0.812024
How Smooth Is Attention? · ICML 2024
Machine learning › Deep learning architectures and training
transformer
0.812024
How Smooth Is Attention? · ICML 2024

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

mean-field analysis · 0.8layer normalization · 0.8
YearPublicationVenuePosition
2024 How Smooth Is Attention?
abstract
Self-attention and masked self-attention are at the heart of Transformers’ outstanding success. Still, our mathematical understanding of attention, in particular of its Lipschitz properties — which are key when it comes to analyzing robustness and expressive power — is incomplete. We provide a detailed study of the Lipschitz constant of self-attention in several practical scenarios, discussing the impact of the sequence length $n$ and layer normalization on the local Lipschitz constant of both unmasked and masked self-attention. In particular, we show that for inputs of length $n$ in any compact set, the Lipschitz constant of self-attention is bounded by $\sqrt{n}$ up to a constant factor and that this bound is tight for reasonable sequence lengths. When the sequence length $n$ is too large for the previous bound to be tight, which we refer to as the mean-field regime, we provide an upper bound and a matching lower bound which are independent of $n$. Our mean-field framework for masked self-attention is novel and of independent interest. Our experiments on pretrained and randomly initialized BERT and GPT-2 support our theoretical findings.
Valérie Castin, Pierre Ablin, Gabriel Peyré
ICML1