← Search

Steffen Schneider

9 accepted papers

2025

ConceptScope: Characterizing Dataset Bias via Disentangled Visual Concepts

NeurIPS 2025poster

Dataset bias, where data points are skewed to certain concepts, is ubiquitous in machine learning datasets. Yet, systematically identifying these biases is challenging without costly, fine-grained attribute annotations. We present ConceptScope, a scalable and automated framework for analyzing visual…

Cited by 0SourceScholar
2025

Equivariance by Contrast: Identifiable Equivariant Embeddings from Unlabeled Finite Group Actions

NeurIPS 2025poster

We propose Equivariance by Contrast (EbC) to learn equivariant embeddings from observation pairs $(\mathbf{y}, g \cdot \mathbf{y})$, where $g$ is drawn from a finite group acting on the data. Our method jointly learns a latent space and a group representation in which group actions correspond to inv…

Cited by 0SourceScholar
2025

Self-supervised contrastive learning performs non-linear system identification

ICLR 2025poster

Self-supervised learning (SSL) approaches have brought tremendous success across many tasks and domains. It has been argued that these successes can be attributed to a link between SSL and identifiable representation learning: Temporal structure and auxiliary variables ensure that latent representat…

2025

Sparse autoencoders reveal selective remapping of visual concepts during adaptation

ICLR 2025poster

Adapting foundation models for specific purposes has become a standard approach to build machine learning systems for downstream applications. Yet, it is an open question which mechanisms take place during adaptation. Here we develop a new Sparse Autoencoder (SAE) for the CLIP vision transformer, na…

2025

Time-series attribution maps with regularized contrastive learning

AISTATS 2025poster

Gradient-based attribution methods aim to explain decisions of deep learning models but so far lack identifiability guarantees. Here, we propose a method to generate attribution maps with identifiability guarantees by developing a regularized contrastive learning algorithm trained on time-series dat…

Cited by 0SourcecodeScholar
2023

RDumb: A simple approach that questions our progress in continual test-time adaptation

NeurIPS 2023poster

Test-Time Adaptation (TTA) allows to update pre-trained models to changing data distributions at deployment time. While early work tested these algorithms for individual fixed distribution shifts, recent work proposed and applied methods for continual adaptation over long timescales. To examine the…

2021

Contrastive Learning Inverts the Data Generating Process

ICML 2021spotlight

Contrastive learning has recently seen tremendous success in self-supervised learning. So far, however, it is largely unclear why the learned representations generalize so effectively to a large variety of downstream tasks. We here prove that feedforward models trained with objectives belonging to t…

2020

Improving robustness against common corruptions by covariate shift adaptation

NeurIPS 2020poster

Today’s state-of-the-art machine vision models are vulnerable to image corruptions like blurring or compression artefacts, limiting their performance in many real-world applications. We here argue that popular benchmarks to measure model robustness against common corruptions (like ImageNet-C) undere…

2020

vq-wav2vec: Self-Supervised Learning of Discrete Speech Representations

ICLR 2020poster

We propose vq-wav2vec to learn discrete representations of audio segments through a wav2vec-style self-supervised context prediction task. The algorithm uses either a gumbel softmax or online k-means clustering to quantize the dense representations. Discretization enables the direct application of a…

Cited by 811SourceScholar