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.

Hubert Ramsauer

dblp:159/2020 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
2since 2021 · last 2022
—ORCID · none

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

Artificial intelligence and machine learning · 5 · 1 first-author · 2 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
5 papers
Representation and self-supervised learning · 37% Deep learning architectures and training · 23% Generative modeling · 15%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
generative adversarial network
0.622018
Coulomb GANs: Provably Optimal Nash Equilibria via Potential Fields · ICLR (Poster) 2018
GANs Trained by a Two Time-Scale Update Rule Converge to a Local Nash Equilibrium · NIPS 2017
Machine learning › Representation and self-supervised learning
contrastive learning
0.612022
CLOOB: Modern Hopfield Networks with InfoLOOB Outperform CLIP · NeurIPS 2022
Machine learning › Representation and self-supervised learning › associative memory
modern hopfield model
0.612022
CLOOB: Modern Hopfield Networks with InfoLOOB Outperform CLIP · NeurIPS 2022
Machine learning › Representation and self-supervised learning
multimodal representation learning
0.612022
CLOOB: Modern Hopfield Networks with InfoLOOB Outperform CLIP · NeurIPS 2022
Machine learning › Representation and self-supervised learning
associative memory
0.512021
Hopfield Networks is All You Need · ICLR 2021
Machine learning › Deep learning architectures and training › recurrent neural network
hopfield network
0.512021
Hopfield Networks is All You Need · ICLR 2021
Machine learning › Deep learning architectures and training
attention mechanism
0.412020
Modern Hopfield Networks and Attention for Immune Repertoire Classification · NeurIPS 2020
Machine learning › Learning paradigms › multiple instance learning
deep multiple instance learning
0.412020
Modern Hopfield Networks and Attention for Immune Repertoire Classification · NeurIPS 2020
Machine learning › Deep learning architectures and training › attention mechanism › memory-augmented attention
hopfield network attention
0.412020
Modern Hopfield Networks and Attention for Immune Repertoire Classification · NeurIPS 2020
Machine learning › Learning paradigms
multiple instance learning
0.412020
Modern Hopfield Networks and Attention for Immune Repertoire Classification · NeurIPS 2020
Bioinformatics and computational biology › immunoinformatics
immune repertoire classification
0.412020
Modern Hopfield Networks and Attention for Immune Repertoire Classification · NeurIPS 2020
Knowledge, reasoning and agents › Multi-agent systems › game theory
nash equilibrium
0.312018
Coulomb GANs: Provably Optimal Nash Equilibria via Potential Fields · ICLR (Poster) 2018
Machine learning › Generative modeling › generative adversarial network › GAN training
GAN training convergence
0.312017
GANs Trained by a Two Time-Scale Update Rule Converge to a Local Nash Equilibrium · NIPS 2017
Machine learning › Transfer learning and domain adaptation
zero-shot transfer
0.212022
CLOOB: Modern Hopfield Networks with InfoLOOB Outperform CLIP · NeurIPS 2022
Machine learning › Optimization for machine learning
stochastic approximation
0.112017
GANs Trained by a Two Time-Scale Update Rule Converge to a Local Nash Equilibrium · NIPS 2017

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

transformer · 0.9hopfield network · 0.9coulomb potential · 0.7modern hopfield networks · 0.6InfoNCE · 0.6InfoLOOB · 0.6energy-based model · 0.5attention mechanism · 0.5potential fields · 0.3potential field · 0.3adam · 0.3
YearPublicationVenuePosition
2022 CLOOB: Modern Hopfield Networks with InfoLOOB Outperform CLIP
abstract
CLIP yielded impressive results on zero-shot transfer learning tasks and is considered as a foundation model like BERT or GPT3. CLIP vision models that have a rich representation are pre-trained using the InfoNCE objective and natural language supervision before they are fine-tuned on particular tasks. Though CLIP excels at zero-shot transfer learning, it suffers from an explaining away problem, that is, it focuses on one or few features, while neglecting other relevant features. This problem is caused by insufficiently extracting the covariance structure in the original multi-modal data. We suggest to use modern Hopfield networks to tackle the problem of explaining away. Their retrieved embeddings have an enriched covariance structure derived from co-occurrences of features in the stored embeddings. However, modern Hopfield networks increase the saturation effect of the InfoNCE objective which hampers learning. We propose to use the InfoLOOB objective to mitigate this saturation effect. We introduce the novel "Contrastive Leave One Out Boost" (CLOOB), which uses modern Hopfield networks for covariance enrichment together with the InfoLOOB objective. In experiments we compare CLOOB to CLIP after pre-training on the Conceptual Captions and the YFCC dataset with respect to their zero-shot transfer learning performance on other datasets. CLOOB consistently outperforms CLIP at zero-shot transfer learning across all considered architectures and datasets.
Andreas Fürst, Elisabeth Rumetshofer, Johannes Lehner, Viet T. Tran, Hubert Ramsauer, David P. Kreil, Michael Kopp 0001, Günter Klambauer, Angela Bitto-Nemling, Sepp Hochreiter
NeurIPS6
2021 Hopfield Networks is All You Need
Hubert Ramsauer, Bernhard Schäfl, Johannes Lehner, Philipp Seidl, Michael Widrich, Lukas Gruber, Markus Holzleitner, Thomas Adler, David P. Kreil, Michael Kopp 0001, Günter Klambauer, Johannes Brandstetter, Sepp Hochreiter
ICLR1
2020 Modern Hopfield Networks and Attention for Immune Repertoire Classification
abstract
A central mechanism in machine learning is to identify, store, and recognize patterns. How to learn, access, and retrieve such patterns is crucial in Hopfield networks and the more recent transformer architectures. We show that the attention mechanism of transformer architectures is actually the update rule of modern Hopfield networks that can store exponentially many patterns. We exploit this high storage capacity of modern Hopfield networks to solve a challenging multiple instance learning (MIL) problem in computational biology: immune repertoire classification. In immune repertoire classification, a vast number of immune receptors are used to predict the immune status of an individual. This constitutes a MIL problem with an unprecedentedly massive number of instances, two orders of magnitude larger than currently considered problems, and with an extremely low witness rate. Accurate and interpretable machine learning methods solving this problem could pave the way towards new vaccines and therapies, which is currently a very relevant research topic intensified by the COVID-19 crisis. In this work, we present our novel method DeepRC that integrates transformer-like attention, or equivalently modern Hopfield networks, into deep learning architectures for massive MIL such as immune repertoire classification. We demonstrate that DeepRC outperforms all other methods with respect to predictive performance on large-scale experiments including simulated and real-world virus infection data and enables the extraction of sequence motifs that are connected to a given disease class. Source code and datasets: https://github.com/ml-jku/DeepRC
Michael Widrich, Bernhard Schäfl, Milena Pavlovic, Hubert Ramsauer, Lukas Gruber, Markus Holzleitner, Johannes Brandstetter, Geir Kjetil Sandve, Victor Greiff, Sepp Hochreiter, Günter Klambauer
NeurIPS4
2018 Coulomb GANs: Provably Optimal Nash Equilibria via Potential Fields
Thomas Unterthiner, Bernhard Nessler, Calvin Seward, Günter Klambauer, Martin Heusel, Hubert Ramsauer, Sepp Hochreiter
ICLR (Poster)6
2017 GANs Trained by a Two Time-Scale Update Rule Converge to a Local Nash Equilibrium
abstract
Generative Adversarial Networks (GANs) excel at creating realistic images with complex models for which maximum likelihood is infeasible. However, the convergence of GAN training has still not been proved. We propose a two time-scale update rule (TTUR) for training GANs with stochastic gradient descent on arbitrary GAN loss functions. TTUR has an individual learning rate for both the discriminator and the generator. Using the theory of stochastic approximation, we prove that the TTUR converges under mild assumptions to a stationary local Nash equilibrium. The convergence carries over to the popular Adam optimization, for which we prove that it follows the dynamics of a heavy ball with friction and thus prefers flat minima in the objective landscape. For the evaluation of the performance of GANs at image generation, we introduce the `Fréchet Inception Distance'' (FID) which captures the similarity of generated images to real ones better than the Inception Score. In experiments, TTUR improves learning for DCGANs and Improved Wasserstein GANs (WGAN-GP) outperforming conventional GAN training on CelebA, CIFAR-10, SVHN, LSUN Bedrooms, and the One Billion Word Benchmark.
Martin Heusel, Hubert Ramsauer, Thomas Unterthiner, Bernhard Nessler, Sepp Hochreiter
NIPS2