← Search

Pascal Esser

5 accepted papers

2025

When Can We Approximate Wide Contrastive Models with Neural Tangent Kernels and Principal Component Analysis?

AAAI 2025technical

Contrastive learning is a paradigm for learning representations from unlabelled data and several recent works have claimed that such models effectively learn spectral embeddings and show relations between (wide) contrastive models and kernel principal component analysis (PCA). However, it is not kno…

Cited by 1SourcePDFScholar
2024

Non-parametric Representation Learning with Kernels

AAAI 2024technical

Unsupervised and self-supervised representation learning has become popular in recent years for learning useful features from unlabelled data. Representation learning has been mostly developed in the neural network literature, and other models for representation learning are surprisingly unexplored.…

Cited by 7SourcePDFScholar
2023

Improved Representation Learning Through Tensorized Autoencoders

AISTATS 2023poster

The central question in representation learning is what constitutes a good or meaningful representation. In this work we argue that if we consider data with inherent cluster structures, where clusters can be characterized through different means and covariances, those data structures should be repre…

Cited by 2SourcePDFScholar
2021

Learning Theory Can (Sometimes) Explain Generalisation in Graph Neural Networks

NeurIPS 2021poster

In recent years, several results in the supervised learning setting suggested that classical statistical learning-theoretic measures, such as VC dimension, do not adequately explain the performance of deep learning models which prompted a slew of work in the infinite-width and iteration regimes. How…

Cited by 66SourcePDFScholar