I am a second-year PhD student in machine learning advised by Prof. Carl Rasmussen at the University of Cambridge. My research interests are in uncertainty-aware Bayesian machine learning algorithms. More concretely, I focus on time-series models for reinforcement learning, mostly based on Gaussian processes. I’m also interested in Bayesian neural networks: better approximate inference schemes, and what they can tell us about why neural networks work.

I hold a MSc in Computer Science from the University of Oxford. While an undergraduate at Universitat Pompeu Fabra in Barcelona, I co-founded MonkingMe, an online music distribution company.

I am a co-organiser of the ICLR 2019 workshop “Safe Machine Learning: Specification, Robustness and Assurance”.

I run the Engineering Safe AI reading group about technical approaches to ensuring AI has a positive impact in society, as part of Effective Altruism Cambridge.

We show that CNNs and ResNets with appropriate priors on the parameters are Gaussian processes in the limit of infinitely many convolutional filters.

Accepted to ICLR,
2019

How much domain knowledge do a SoTA planning algorithm, and a basic RL algorithm, need to solve Montezuma’s Revenge, the benchmark for sparse rewards in RL? It turns out that a few simple tweaks do it, but we speculate that it’s not straightforward to do equivalent tweaks automatically for other games.

BSc Thesis,
2016

Entry to the Malmö Collaborative AI Challenge, got 1st and 3rd places in different categories.

Use case You have to run your program on a remote server. However your favourite editor with your favourite configuration isn’t …

Let’s say we believe consequentialism and utilitarianism. Roughly, we hold that the morality of an action depends only on its …

Attention! For those of you who do not understand Catalan, There is an English translation below!
La meva germana i jo vam començar a …

This is a writeup of the problems my team solved in the Murcia contest, which we were participating in as preparation for SWERC. Those …

The information in this post is taken from the sources listed in the Sources section at the end of it. If you don’t care about …

We show that CNNs and ResNets with appropriate priors on the parameters are Gaussian processes in the limit of infinitely many …

A method for filling in missing measurements in points in datasets, with some statistical assumptions, by drawing from the conditional …

How much domain knowledge do a SoTA planning algorithm, and a basic RL algorithm, need to solve Montezuma’s Revenge, the …