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.

Nadine Behrmann

dblp:278/8008 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
5since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 3 first-author · 4 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
4 papers
Representation and self-supervised learning · 33% Video understanding and tracking · 32% Deep learning architectures and training · 23%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning
contrastive learning
1.122022
Ranking Info Noise Contrastive Estimation: Boosting Contrastive Learning via Ranked Positives · AAAI 2022
Long Short View Feature Decomposition via Contrastive Video Representation Learning · ICCV 2021
Machine learning › Deep learning architectures and training › attention mechanism
self-attention
0.812024
Eureka-Moments in Transformers: Multi-Step Tasks Reveal Softmax Induced Optimization Problems · ICML 2024
Machine learning › Deep learning architectures and training
transformer
0.812024
Eureka-Moments in Transformers: Multi-Step Tasks Reveal Softmax Induced Optimization Problems · ICML 2024
Computer vision › Video understanding and tracking
action segmentation
0.612022
Unified Fully and Timestamp Supervised Temporal Action Segmentation via Sequence to Sequence Translation · ECCV (35) 2022
Machine learning › Representation and self-supervised learning › contrastive learning › contrastive loss
InfoNCE
0.612022
Ranking Info Noise Contrastive Estimation: Boosting Contrastive Learning via Ranked Positives · AAAI 2022
Computer vision › Video understanding and tracking › video representation learning
self-supervised video representation learning
0.512021
Long Short View Feature Decomposition via Contrastive Video Representation Learning · ICCV 2021
Machine learning › Representation and self-supervised learning › contrastive learning › temporal contrastive learning
video contrastive learning
0.512021
Long Short View Feature Decomposition via Contrastive Video Representation Learning · ICCV 2021
Computer vision › Video understanding and tracking
video representation learning
0.512021
Long Short View Feature Decomposition via Contrastive Video Representation Learning · ICCV 2021
Natural language and speech › Language models and text generation
in-context learning
0.212024
Eureka-Moments in Transformers: Multi-Step Tasks Reveal Softmax Induced Optimization Problems · ICML 2024
Machine learning › Learning theory
classification
0.212022
Ranking Info Noise Contrastive Estimation: Boosting Contrastive Learning via Ranked Positives · AAAI 2022
Machine learning › Trustworthy machine learning › robustness
out-of-distribution detection
0.212022
Ranking Info Noise Contrastive Estimation: Boosting Contrastive Learning via Ranked Positives · AAAI 2022
Natural language and speech › Language models and text generation › language modeling › language model architecture
sequence-to-sequence model
0.212022
Unified Fully and Timestamp Supervised Temporal Action Segmentation via Sequence to Sequence Translation · ECCV (35) 2022

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

contrastive learning · 1.1training dynamics analysis · 0.8synthetic task design · 0.8weak supervision · 0.6sequence-to-sequence translation · 0.6InfoNCE · 0.6
YearPublicationVenuePosition
2024 Eureka-Moments in Transformers: Multi-Step Tasks Reveal Softmax Induced Optimization Problems
abstract
In this work, we study rapid improvements of the training loss in transformers when being confronted with multi-step decision tasks. We found that transformers struggle to learn the intermediate task and both training and validation loss saturate for hundreds of epochs. When transformers finally learn the intermediate task, they do this rapidly and unexpectedly. We call these abrupt improvements Eureka-moments, since the transformer appears to suddenly learn a previously incomprehensible concept. We designed synthetic tasks to study the problem in detail, but the leaps in performance can be observed also for language modeling and in-context learning (ICL). We suspect that these abrupt transitions are caused by the multi-step nature of these tasks. Indeed, we find connections and show that ways to improve on the synthetic multi-step tasks can be used to improve the training of language modeling and ICL. Using the synthetic data we trace the problem back to the Softmax function in the self-attention block of transformers and show ways to alleviate the problem. These fixes reduce the required number of training steps, lead to higher likelihood to learn the intermediate task, to higher final accuracy and training becomes more robust to hyper-parameters.
David T. Hoffmann, Simon Schrodi, Jelena Bratulic, Nadine Behrmann, Volker Fischer 0003, Thomas Brox
ICML4
2022 Ranking Info Noise Contrastive Estimation: Boosting Contrastive Learning via Ranked Positives
abstract
This paper introduces Ranking Info Noise Contrastive Estimation (RINCE), a new member in the family of InfoNCE losses that preserves a ranked ordering of positive samples. In contrast to the standard InfoNCE loss, which requires a strict binary separation of the training pairs into similar and dissimilar samples, RINCE can exploit information about a similarity ranking for learning a corresponding embedding space. We show that the proposed loss function learns favorable embeddings compared to the standard InfoNCE whenever at least noisy ranking information can be obtained or when the definition of positives and negatives is blurry. We demonstrate this for a supervised classification task with additional superclass labels and noisy similarity scores. Furthermore, we show that RINCE can also be applied to unsupervised training with experiments on unsupervised representation learning from videos. In particular, the embedding yields higher classification accuracy, retrieval rates and performs better on out-of-distribution detection than the standard InfoNCE loss.
David T. Hoffmann, Nadine Behrmann, Juergen Gall, Thomas Brox, Mehdi Noroozi
AAAI2
2022 Unified Fully and Timestamp Supervised Temporal Action Segmentation via Sequence to Sequence Translation
Nadine Behrmann, S. Alireza Golestaneh, J. Zico Kolter, Juergen Gall, Mehdi Noroozi
ECCV (35)1
2021 Long Short View Feature Decomposition via Contrastive Video Representation Learning
abstract
Self-supervised video representation methods typically focus on the representation of temporal attributes in videos. However, the role of stationary versus non-stationary attributes is less explored: Stationary features, which remain similar throughout the video, enable the prediction of video-level action classes. Non-stationary features, which represent temporally varying attributes, are more beneficial for downstream tasks involving more fine-grained temporal understanding, such as action segmentation. We argue that a single representation to capture both types of features is sub-optimal, and propose to decompose the representation space into stationary and non-stationary features via contrastive learning from long and short views, i.e. long video sequences and their shorter sub-sequences. Stationary features are shared between the short and long views, while non-stationary features aggregate the short views to match the corresponding long view. To empirically verify our approach, we demonstrate that our stationary features work particularly well on an action recognition downstream task, while our non-stationary features perform better on action segmentation. Furthermore, we analyse the learned representations and find that stationary features capture more temporally stable, static attributes, while non-stationary features encompass more temporally varying ones.
Nadine Behrmann, Mohsen Fayyaz, Juergen Gall, Mehdi Noroozi
ICCV1
2021 Unsupervised Video Representation Learning by Bidirectional Feature Prediction
abstract
This paper introduces a novel method for self-supervised video representation learning via feature prediction. In contrast to the previous methods that focus on future feature prediction, we argue that a supervisory signal arising from unobserved past frames is complementary to one that originates from the future frames. The rationale behind our method is to encourage the network to explore the temporal structure of videos by distinguishing between future and past given present observations. We train our model in a contrastive learning framework, where joint encoding of future and past provides us with a comprehensive set of temporal hard negatives via swapping. We empirically show that utilizing both signals enriches the learned representations for the downstream task of action recognition. It out-performs independent prediction of future and past.
Nadine Behrmann, Juergen Gall, Mehdi Noroozi
WACV1