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

Angela Bitto-Nemling

dblp:304/8183 · also Angela Bitto · DBLP profile ↗
← Back
2ranked-venue papers
0as 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 · 2 · 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
2 papers
Reinforcement learning · 44% Representation and self-supervised learning · 44% Language models and text generation · 9%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning
contrastive learning
0.612022
CLOOB: Modern Hopfield Networks with InfoLOOB Outperform CLIP · NeurIPS 2022
Machine learning › Reinforcement learning › partially observable reinforcement learning
history representation
0.612022
History Compression via Language Models in Reinforcement Learning · ICML 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 › Reinforcement learning
partially observable reinforcement learning
0.612022
History Compression via Language Models in Reinforcement Learning · ICML 2022
Machine learning › Reinforcement learning › sample efficiency
sample-efficient reinforcement learning
0.612022
History Compression via Language Models in Reinforcement Learning · ICML 2022
Natural language and speech › Language models and text generation › pre-trained language model › efficient pre-trained language model
frozen language model
0.212022
History Compression via Language Models in Reinforcement Learning · ICML 2022
Natural language and speech › Language models and text generation
pre-trained language model
0.212022
History Compression via Language Models in Reinforcement Learning · ICML 2022
Machine learning › Transfer learning and domain adaptation
zero-shot transfer
0.212022
CLOOB: Modern Hopfield Networks with InfoLOOB Outperform CLIP · NeurIPS 2022

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

pretrained language transformer · 0.6modern hopfield networks · 0.6hopfield network · 0.6actor-critic · 0.6InfoNCE · 0.6InfoLOOB · 0.6
YearPublicationVenuePosition
2022 History Compression via Language Models in Reinforcement Learning
abstract
In a partially observable Markov decision process (POMDP), an agent typically uses a representation of the past to approximate the underlying MDP. We propose to utilize a frozen Pretrained Language Transformer (PLT) for history representation and compression to improve sample efficiency. To avoid training of the Transformer, we introduce FrozenHopfield, which automatically associates observations with pretrained token embeddings. To form these associations, a modern Hopfield network stores these token embeddings, which are retrieved by queries that are obtained by a random but fixed projection of observations. Our new method, HELM, enables actor-critic network architectures that contain a pretrained language Transformer for history representation as a memory module. Since a representation of the past need not be learned, HELM is much more sample efficient than competitors. On Minigrid and Procgen environments HELM achieves new state-of-the-art results. Our code is available at https://github.com/ml-jku/helm.
Fabian Paischer, Thomas Adler, Vihang Patil, Angela Bitto-Nemling, Markus Holzleitner, Sebastian Lehner, Hamid Eghbalzadeh, Sepp Hochreiter
ICML4
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
NeurIPS10