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

Sindy Löwe

dblp:223/4740 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
5since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 6 · 2 first-author · 5 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 · 38% Deep learning architectures and training · 19% 3D vision · 15%

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

TopicWeightPapersLastEvidence papers
Computer vision › Vision and language › compositionality
binding problem
0.712023
Rotating Features for Object Discovery · NeurIPS 2023
Computer vision › 3D vision
object representation
0.712023
Rotating Features for Object Discovery · NeurIPS 2023
Machine learning › Representation and self-supervised learning
causal representation learning
0.612022
CITRIS: Causal Identifiability from Temporal Intervened Sequences · ICML 2022
Machine learning › Generative modeling
variational autoencoder
0.612022
CITRIS: Causal Identifiability from Temporal Intervened Sequences · ICML 2022
Machine learning › Efficient and distributed learning
distributed training
0.412019
Putting An End to End-to-End: Gradient-Isolated Learning of Representations · NeurIPS 2019
Machine learning › Representation and self-supervised learning
contrastive learning
0.112019
Putting An End to End-to-End: Gradient-Isolated Learning of Representations · NeurIPS 2019

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

kuramoto synchronization · 0.9competitive learning · 0.9distributed object-centric representation · 0.7complex autoencoder · 0.7causal representation learning · 0.7variational autoencoder · 0.6normalizing flow · 0.6greedy layer-wise training · 0.4InfoNCE · 0.4
YearPublicationVenuePosition
2025 Artificial Kuramoto Oscillatory Neurons
abstract
It has long been known in both neuroscience and AI that ``binding'' between neurons leads to a form of competitive learning where representations are compressed in order to represent more abstract concepts in deeper layers of the network. More recently, it was also hypothesized that dynamic (spatiotemporal) representations play an important role in both neuroscience and AI. Building on these ideas, we introduce Artificial Kuramoto Oscillatory Neurons (AKOrN) as a dynamical alternative to threshold units, which can be combined with arbitrary connectivity designs such as fully connected, convolutional, or attentive mechanisms. Our generalized Kuramoto updates bind neurons together through their synchronization dynamics. We show that this idea provides performance improvements across a wide spectrum of tasks such as unsupervised object discovery, adversarial robustness, calibrated uncertainty quantification, and reasoning. We believe that these empirical results show the importance of rethinking our assumptions at the most basic neuronal level of neural representation, and in particular show the importance of dynamical representations. Code: https://github.com/autonomousvision/akorn Project page: https://takerum.github.io/akorn_project_page/
Takeru Miyato, Sindy Löwe, Andreas Geiger 0001, Max Welling
ICLR2
2023 Causal Representation Learning for Instantaneous and Temporal Effects in Interactive Systems
Phillip Lippe, Sara Magliacane, Sindy Löwe, Yuki Markus Asano, Taco Cohen, Efstratios Gavves
ICLR3
2023 Rotating Features for Object Discovery
abstract
The binding problem in human cognition, concerning how the brain represents and connects objects within a fixed network of neural connections, remains a subject of intense debate. Most machine learning efforts addressing this issue in an unsupervised setting have focused on slot-based methods, which may be limiting due to their discrete nature and difficulty to express uncertainty. Recently, the Complex AutoEncoder was proposed as an alternative that learns continuous and distributed object-centric representations. However, it is only applicable to simple toy data. In this paper, we present Rotating Features, a generalization of complex-valued features to higher dimensions, and a new evaluation procedure for extracting objects from distributed representations. Additionally, we show the applicability of our approach to pre-trained features. Together, these advancements enable us to scale distributed object-centric representations from simple toy to real-world data. We believe this work advances a new paradigm for addressing the binding problem in machine learning and has the potential to inspire further innovation in the field.
Sindy Löwe, Phillip Lippe, Francesco Locatello, Max Welling
NeurIPS1
2023 BISCUIT: Causal Representation Learning from Binary Interactions
abstract
Identifying the causal variables of an environment and how to intervene on them is of core value in applications such as robotics and embodied AI. While an agent can commonly interact with the environment and may implicitly perturb the behavior of some of these causal variables, often the targets it affects remain unknown. In this paper, we show that causal variables can still be identified for many common setups, e.g., additive Gaussian noise models, if the agent’s interactions with a causal variable can be described by an unknown binary variable. This happens when each causal variable has two different mechanisms, e.g., an observational and an interventional one. Using this identifiability result, we propose BISCUIT, a method for simultaneously learning causal variables and their corresponding binary interaction variables. On three robotic-inspired datasets, BISCUIT accurately identifies causal variables and can even be scaled to complex, realistic environments for embodied AI.
Phillip Lippe, Sara Magliacane, Sindy Löwe, Yuki Markus Asano, Taco Cohen, Efstratios Gavves
UAI3
2022 CITRIS: Causal Identifiability from Temporal Intervened Sequences
abstract
Understanding the latent causal factors of a dynamical system from visual observations is considered a crucial step towards agents reasoning in complex environments. In this paper, we propose CITRIS, a variational autoencoder framework that learns causal representations from temporal sequences of images in which underlying causal factors have possibly been intervened upon. In contrast to the recent literature, CITRIS exploits temporality and observing intervention targets to identify scalar and multidimensional causal factors, such as 3D rotation angles. Furthermore, by introducing a normalizing flow, CITRIS can be easily extended to leverage and disentangle representations obtained by already pretrained autoencoders. Extending previous results on scalar causal factors, we prove identifiability in a more general setting, in which only some components of a causal factor are affected by interventions. In experiments on 3D rendered image sequences, CITRIS outperforms previous methods on recovering the underlying causal variables. Moreover, using pretrained autoencoders, CITRIS can even generalize to unseen instantiations of causal factors, opening future research areas in sim-to-real generalization for causal representation learning.
Phillip Lippe, Sara Magliacane, Sindy Löwe, Yuki Markus Asano, Taco Cohen, Stratis Gavves
ICML3
2019 Putting An End to End-to-End: Gradient-Isolated Learning of Representations
abstract
We propose a novel deep learning method for local self-supervised representation learning that does not require labels nor end-to-end backpropagation but exploits the natural order in data instead. Inspired by the observation that biological neural networks appear to learn without backpropagating a global error signal, we split a deep neural network into a stack of gradient-isolated modules. Each module is trained to maximally preserve the information of its inputs using the InfoNCE bound from Oord et al [2018]. Despite this greedy training, we demonstrate that each module improves upon the output of its predecessor, and that the representations created by the top module yield highly competitive results on downstream classification tasks in the audio and visual domain. The proposal enables optimizing modules asynchronously, allowing large-scale distributed training of very deep neural networks on unlabelled datasets.
Sindy Löwe, Peter O'Connor, Bastiaan S. Veeling
NeurIPS1