← Search

Simon Schug

7 accepted papers

2024

Discovering modular solutions that generalize compositionally

ICLR 2024poster

Many complex tasks can be decomposed into simpler, independent parts. Discovering such underlying compositional structure has the potential to enable compositional generalization. Despite progress, our most powerful systems struggle to compose flexibly. It therefore seems natural to make models more…

2023

Online learning of long-range dependencies

NeurIPS 2023poster

Online learning holds the promise of enabling efficient long-term credit assignment in recurrent neural networks. However, current algorithms fall short of offline backpropagation by either not being scalable or failing to learn long-range dependencies. Here we present a high-performance online lear…

2023

Would I have gotten that reward? Long-term credit assignment by counterfactual contribution analysis

NeurIPS 2023spotlight

To make reinforcement learning more sample efficient, we need better credit assignment methods that measure an action’s influence on future rewards. Building upon Hindsight Credit Assignment (HCA), we introduce Counterfactual Contribution Analysis (COCOA), a new family of model-based credit assignme…

2022

A contrastive rule for meta-learning

NeurIPS 2022accept

Humans and other animals are capable of improving their learning performance as they solve related tasks from a given problem domain, to the point of being able to learn from extremely limited data. While synaptic plasticity is generically thought to underlie learning in the brain, the precise neura…

2021

Learning where to learn: Gradient sparsity in meta and continual learning

NeurIPS 2021poster

Finding neural network weights that generalize well from small datasets is difficult. A promising approach is to learn a weight initialization such that a small number of weight changes results in low generalization error. We show that this form of meta-learning can be improved by letting the learni…