← Search

Leo Feng

7 accepted papers

2025

Adaptive teachers for amortized samplers

ICLR 2025poster

Amortized inference is the task of training a parametric model, such as a neural network, to approximate a distribution with a given unnormalized density where exact sampling is intractable. When sampling is modeled as a sequential decision-making process, reinforcement learning (RL) methods, such a…

2024

Memory Efficient Neural Processes via Constant Memory Attention Block

ICML 2024poster

Neural Processes (NPs) are popular meta-learning methods for efficiently modelling predictive uncertainty. Recent state-of-the-art methods, however, leverage expensive attention mechanisms, limiting their applications, particularly in low-resource settings. In this work, we propose Constant Memory A…

2024

Tree Cross Attention

ICLR 2024poster

Cross Attention is a popular method for retrieving information from a set of context tokens for making predictions. At inference time, for each prediction, Cross Attention scans the full set of $\mathcal{O}(N)$ tokens. In practice, however, often only a small subset of tokens are required for good p…

2023

Latent Bottlenecked Attentive Neural Processes

ICLR 2023poster

Neural Processes (NPs) are popular methods in meta-learning that can estimate predictive uncertainty on target datapoints by conditioning on a context dataset. Previous state-of-the-art method Transformer Neural Processes (TNPs) achieve strong performance but require quadratic computation with respe…

2023

Towards Better Selective Classification

ICLR 2023poster

We tackle the problem of Selective Classification where the objective is to achieve the best performance on a predetermined ratio (coverage) of the dataset. Recent state-of-the-art selective methods come with architectural changes either via introducing a separate selection head or an extra abstenti…

2022

Continuous-Time Meta-Learning with Forward Mode Differentiation

ICLR 2022spotlight

Drawing inspiration from gradient-based meta-learning methods with infinitely small gradient steps, we introduce Continuous-Time Meta-Learning (COMLN), a meta-learning algorithm where adaptation follows the dynamics of a gradient vector field. Specifically, representations of the inputs are meta-lea…

Cited by 26SourcePDFScholar
2021

Exploration in Approximate Hyper-State Space for Meta Reinforcement Learning

ICML 2021spotlight

To rapidly learn a new task, it is often essential for agents to explore efficiently - especially when performance matters from the first timestep. One way to learn such behaviour is via meta-learning. Many existing methods however rely on dense rewards for meta-training, and can fail catastrophical…