You are all cordially invited to the AMLab seminar on Thursday Feb 28th at 16:00 in C3.163, where Christos Louizos will give a talk titled “Learning Exchangeable Distributions”. Afterwards there are the usual drinks and snacks!
Abstract: We present a new family of models that directly parametrize exchangeable distributions; it is realized via the introduction of an explicit model for the dependency structure of the joint probability distribution over the data, while respecting the permutation invariance of an exchangeable distribution. This is achieved by combining two recent advances in variational inference and probabilistic modelling for graphs, normalizing flows and (di)graphons. We, empirically, demonstrate that such models are also approximately consistent, hence they can also provide epistemic uncertainty about their predictions without positing an explicit prior over global variables. We show how to train such models on data and evaluate their predictive capabilities as well as the quality of their uncertainty on various tasks.
You are all cordially invited to the AMLab seminar on Thursday Feb 21st at 16:00 in C3.163, where Thomas Kipf will give a talk titled “Compositional Imitation Learning: Explaining and executing one task at a time”. Afterwards there are the usual drinks and snacks!
Abstract: We introduce a framework for Compositional Imitation Learning and Execution (CompILE) of hierarchically-structured behavior. CompILE learns reusable, variable-length segments of behavior from demonstration data using a novel unsupervised, fully-differentiable sequence segmentation module. These learned behaviors can then be re-composed and executed to perform new tasks. At training time, CompILE auto-encodes observed behavior into a sequence of latent codes, each corresponding to a variable-length segment in the input sequence. Once trained, our model generalizes to sequences of longer length and from environment instances not seen during training. We evaluate our model in a challenging 2D multi-task environment and show that CompILE can find correct task boundaries and event encodings in an unsupervised manner without requiring annotated demonstration data. Latent codes and associated behavior policies discovered by CompILE can be used by a hierarchical agent, where the high-level policy selects actions in the latent code space, and the low-level, task-specific policies are simply the learned decoders. We found that our agent could learn given only sparse rewards, where agents without task-specific policies struggle.
You are all cordially invited to the AMLab seminar on Thursday 14th Feb at 16:00 in C3.163, where Victor Garcia will give a talk titled “GRIN: Graphical Recurrent Inference Networks“. Afterwards there are the usual drinks and snacks!
Abstract: A graphical model is a structured representation of the data generating process. The traditional method to reason over random variables is to perform inference in this graphical model. However, in many cases the generating process is only a poor approximation of the much more complex true data generation process, leading to poor posterior estimates. The subtleties of the generative process are however captured in the data itself and we can “learn to infer”, that is, learn a direct mapping from observations to explanatory latent variables. In this work we propose a hybrid model that combines graphical inference with a learned inverse model, which we structure as a graph neural network. The iterative algorithm is formulated as a recurrent neural network. By using cross-validation we can automatically balance the amount of work performed by graphical inference versus learned inference. We apply our ideas to the Kalman filter, a Gaussian hidden Markov model for time sequences. We apply our “Graphical Recurrent Inference” method to a number of path estimation tasks and show that it successfully outperforms either learned or graphical inference run in isolation.
You are all cordially invited to the AMLab seminar on Thursday January 31 at 16:00 in C3.163, where Emiel Hoogeboom will give a talk titled “Emerging Convolutions for Generative Normalizing Flows”. Afterwards there are the usual drinks and snacks!
Abstract: Generative flows are attractive because they admit exact likelihood optimization and efficient image synthesis. Recently, Kingma & Dhariwal (2018) demonstrated with Glow that generative flows are capable of generating high quality images. We generalize the 1 x 1 convolutions proposed in Glow to invertible d x d convolutions, which are more flexible since they operate on both channel and spatial axes. We propose two methods to produce invertible convolutions that have receptive fields identical to standard convolutions: Emerging convolutions are obtained by chaining specific autoregressive convolutions, and periodic convolutions are decoupled in the frequency domain. Our experiments show that the flexibility of d x d convolutions significantly improves the performance of generative flow models on galaxy images, CIFAR10 and ImageNet.
You are all cordially invited to the AMLab seminar on Thursday January 17 at 16:00 in C3.163, where Herke van Hoof will give a talk titled “Learning Selective Coverage Strategies for Surveying and Search”. Afterwards there are the usual drinks and snacks!
Abstract: In this seminar, I’ll present a project I’ve been working on with Sandeep Manjanna and Gregory Dudek (Mobile Robotics Lab, McGill University). In this project, we investigated selective coverage strategies for a robot tasked with surveying or searching prioritised locations in a given area. This problem can be modelled as a Markov decision process and solved with reinforcement learning strategies, but the state space is extremely large, requiring these states to be aggregated. The proposed state aggregation method is shown to generalize well between different environments. In field tests over reefs at the Folkestone Marine Reserve, using this method an autonomous surface vehicle was able to improve the number of useable visual data samples.
You are all cordially invited to the AMLab seminar on Thursday December 13 at 16:00 in C3.163 (FNWI, Amsterdam Science Park), where Tom Claassen (Radboud/UvA) will give a talk titled “Causal discovery from real-world data: relaxing the faithfulness assumption”. Afterwards there are the usual drinks and snacks.
Abstract: The so-called causal Markov and causal faithfulness assumptions are well-established pillars behind causal discovery from observational data. The first is closely related to the memorylessness property of dynamical systems, and allows us to predict observable conditional independencies in the data from the underlying causal model. The second is the causal equivalent of Ockham’s razor, and enables us to reason backwards from data to the causal model of interest.
Though theoretically reasonable, in practice with limited data from real-world systems we often encounter violations of faithfulness. Some of these, like weak long-distance interactions, are handled surprisingly well by benchmark constraint-based algorithms such as FCI. Other violations may imply inconsistencies between observed (conditional) independence statements in the data that cannot currently be handled both effectively and efficiently by most constraint based algorithms. A fundamental question is whether our output retains any validity when not all our assumptions are satisfied, or whether it is still possible to reliably rescue parts of the model.
In this talk we introduce a novel approach based on a relaxed form of the faithfulness assumption that is able to handle many of the detectable faithfulness violations efficiently while ensuring the output causal model remains valid. Essentially we obtain a principled and efficient form of error-correction on observed in/dependencies, that can significantly improve both accuracy and reliability of the output causal models in practice. True; it cannot handle all possible violations, but the relaxed faithfulness assumption may be a promising step towards a more realistic, and so more effective, underpinning of the challenging task of causal discovery from real-world systems.
You are all cordially invited to the AMLab seminar on Thursday November 29 at 16:00 in C3.163, where Daniel Worrall will give a talk titled “Semigroup Convolutional Neural Networks: Merging Scale-space and Deep Learning”. Afterwards there are the usual drinks and snacks!
Abstract: Group convolutional neural networks (GCNN) are symmetric under predefined, invertible transformations in the input e.g. rotations, flips, and translations. Can we extend this framework in the absence of invertibility, for instance in the case of pixelated image downscalings, or causal time-shifting of audio signals? To this end, I present Semigroup Convolutional Neural Networks (SCNN), a generalisation of GCNNs based on the related theory of semigroups. I will showcase a specialisation of a scale-equivariant SCNN, where the activations of each layer of the network live on a classical scale-space, finally linking the classical field of scale-spaces and modern deep learning.
You are all cordially invited to the AMLab seminar on Thursday November 22 at 16:00 in C3.163 (FNWI, Amsterdam Science Park), where Maurice Weiler will give a talk titled “3D Steerable CNNs”. Afterwards there are the usual drinks and snacks.
Abstract: We present a convolutional network that is equivariant to rigid body motions. The model uses scalar-, vector-, and tensor fields over 3D Euclidean space to represent data, and equivariant convolutions to map between such representations. These SE(3)-equivariant convolutions utilize kernels which are parameterized as a linear combination of a complete steerable kernel basis, which is derived analytically in this paper. We prove that equivariant convolutions are the most general equivariant linear maps between fields over R^3. Our experimental results confirm the effectiveness of 3D Steerable CNNs for the problem of amino acid propensity prediction and protein structure classification, both of which have inherent SE(3) symmetry.
You are all cordially invited to the AMLab seminar on Monday November 12 at 11:00 (note the unusual date and time!) in C3.163 (FNWI, Amsterdam Science Park), where Peter Orbanz (Columbia University) will give a talk titled “Statistical models of large graphs and networks”. Afterwards there are the usual drinks and snacks.
Abstract: Relational data is, roughly speaking, any form of data that can be represented as a graph: A social network, user preference data, protein-protein interactions, etc. A recent body of work, by myself and others, aims to develop a statistical theory of such data for problems where a single graph is observed (such as a small part of a large social network). Keywords include graphon, edge-exchangeable and sparse exchangeable graphs, and many latent variable models used in machine learning. I will summarize the main ideas and results of this theory: How and why the exchangeability assumptions implicit in commonly used models for such data may fail; what can be done about it; what we know about convergence; and implications of these results for methods popular in machine learning, such as graph embeddings and empirical risk minimization.
Bio: Peter Orbanz is associate professor of statistics at Columbia University. His research interests include network and relational data, Bayesian nonparametrics, symmetry principles in machine learning and statistics, and hierarchies of latent variables. He was an undergraduate student at the University of Bonn, a PhD student at ETH Zurich, and a postdoctoral fellow at the University of Cambridge.
You are all cordially invited to the AMLab seminar on Thursday November 8 at 16:00 in C3.163, where Wendy Shang will give a talk titled “Channel-Recurrent Autoencoding”. Afterwards there are the usual drinks and snacks!
Abstract: Understanding the functionalities of high-level features from deep neural networks (DNNs) is a long standing challenge. Towards achieving this ultimate goal, we propose a channel-recurrent architecture in place of the vanilla fully-connected layers to construct more interpretable and expressive latent spaces. Building on Variational Autoencoders (VAEs), we integrate recurrent connections across channels to both inference and generation steps, allowing the high-level features to be captured in global-to-local, coarse-to-fine manners. Combined with adversarial loss as well as two novel regularizations–namely the KL objective weighting scheme over time steps and mutual information maximization between transformed latent variables and the outputs, our channel-recurrent VAE-GAN (crVAE-GAN) outperforms VAE-GAN in generating a diverse spectrum of high resolution images while maintaining the same level of computational efficacy. Moreover, when applying crVAE-GAN in an attribute-conditioned generative setup, we further augment an attention mechanism over each attribute to indicate the specific latent subset responsible for its modulation, further imposing semantic meanings to the latent spaces. Evaluations are through both qualitative visual examination and quantitative metrics.