140 citations · 526 across the 24 of their papers we have counts for
26 papers
Sensitivity Analysis for Climate Science with Generative Flow Models
Alex Dobra, Jakiw Pidstrigach, Tim Reichelt +6
Sensitivity analysis is a cornerstone of climate science, essential for understanding phenomena ranging from storm intensity to long-term climate feedbacks. However, computing thes…
Implicit Neural Representations for Chemical Reaction Paths
Kalyan Ramakrishnan, Lars L. Schaaf, Chen Lin +2
We show that neural networks can be optimized to represent minimum energy paths as continuous functions, offering a flexible alternative to discrete path-search methods such as Nud…
Self-consistent Validation for Machine Learning Electronic Structure
Gengyuan Hu, Gengchen Wei, Zekun Lou +4
Machine learning has emerged as a significant approach to efficiently tackle electronic structure problems. Despite its potential, there is less guarantee for the model to generali…
Faithful Knowledge Distillation
Tom A. Lamb, Rudy Brunel, Krishnamurthy DJ Dvijotham +3
Knowledge distillation (KD) has received much attention due to its success in compressing networks to allow for their deployment in resource-constrained systems. While the problem…
Behind Every Domain There is a Shift: Adapting Distortion-aware Vision Transformers for Panoramic Semantic Segmentation
Jiaming Zhang, Kailun Yang, Hao Shi +7
In this paper, we address panoramic semantic segmentation which is under-explored due to two critical challenges: (1) image distortions and object deformations on panoramas; (2) la…
Gradients without Backpropagation
Atılım Güneş Baydin, Barak A. Pearlmutter, Don Syme +2
Using backpropagation to compute gradients of objective functions for optimization has remained a mainstay of machine learning. Backpropagation, or reverse-mode differentiation, is…
Improved Branch and Bound for Neural Network Verification via Lagrangian Decomposition
Alessandro De Palma, Rudy Bunel, Alban Desmaison +4
We improve the scalability of Branch and Bound (BaB) algorithms for formally proving input-output properties of neural networks. First, we propose novel bounding algorithms based o…
Scaling the Convex Barrier with Sparse Dual Algorithms
Alessandro De Palma, Harkirat Singh Behl, Rudy Bunel +2
Tight and efficient neural network bounding is crucial to the scaling of neural network verification systems. Many efficient bounding algorithms have been presented recently, but t…
Simulation-Based Inference for Global Health Decisions
Christian Schroeder de Witt, Bradley Gram-Hansen, Nantas Nardelli +8
The COVID-19 pandemic has highlighted the importance of in-silico epidemiological modelling in predicting the dynamics of infectious diseases to inform health policy and decision m…
Lagrangian Decomposition for Neural Network Verification
Rudy Bunel, Alessandro De Palma, Alban Desmaison +4
A fundamental component of neural network verification is the computation of bounds on the values their outputs can take. Previous methods have either used off-the-shelf solvers, d…
Amortized Rejection Sampling in Universal Probabilistic Programming
Saeid Naderiparizi, Adam Ścibior, Andreas Munk +9
Naive approaches to amortized inference in probabilistic programs with unbounded loops can produce estimators with infinite variance. This is particularly true of importance sampli…
Branch and Bound for Piecewise Linear Neural Network Verification
Rudy Bunel, Jingyue Lu, Ilker Turkaslan +3
The success of Deep Learning and its potential use in many safety-critical applications has motivated research on formal verification of Neural Network (NN) models. In this context…
Etalumis: Bringing Probabilistic Programming to Scientific Simulators at Scale
Atılım Güneş Baydin, Lei Shao, Wahid Bhimji +14
Probabilistic programming languages (PPLs) are receiving widespread attention for performing Bayesian inference in complex generative models. However, applications to science remai…
Hijacking Malaria Simulators with Probabilistic Programming
Bradley Gram-Hansen, Christian Schröder de Witt, Tom Rainforth +3
Epidemiology simulations have become a fundamental tool in the fight against the epidemics of various infectious diseases like AIDS and malaria. However, the complicated and stocha…
Efficient Relaxations for Dense CRFs with Sparse Higher Order Potentials
Thomas Joy, Alban Desmaison, Thalaiyasingam Ajanthan +5
Dense conditional random fields (CRFs) have become a popular framework for modelling several problems in computer vision such as stereo correspondence and multi-class semantic segm…
A Unified View of Piecewise Linear Neural Network Verification
Rudy Bunel, Ilker Turkaslan, Philip H. S. Torr +2
The success of Deep Learning and its potential use in many safety-critical applications has motivated research on formal verification of Neural Network (NN) models. Despite the rep…
Learning Disentangled Representations with Semi-Supervised Deep Generative Models
N. Siddharth, Brooks Paige, Jan-Willem van de Meent +5
Variational autoencoders (VAEs) learn representations of data by jointly training a probabilistic encoder and decoder network. Typically these models encode all features of the dat…
Learning to superoptimize programs - Workshop Version
Rudy Bunel, Alban Desmaison, M. Pawan Kumar +2
Superoptimization requires the estimation of the best program for a given computational task. In order to deal with large programs, superoptimization techniques perform a stochasti…
Inducing Interpretable Representations with Variational Autoencoders
N. Siddharth, Brooks Paige, Alban Desmaison +5
We develop a framework for incorporating structured graphical models in the \emph{encoders} of variational autoencoders (VAEs) that allows us to induce interpretable representation…
Efficient Linear Programming for Dense CRFs
Thalaiyasingam Ajanthan, Alban Desmaison, Rudy Bunel +3
The fully connected conditional random field (CRF) with Gaussian pairwise potentials has proven popular and effective for multi-class semantic segmentation. While the energy of a d…
Learning to superoptimize programs
Rudy Bunel, Alban Desmaison, M. Pawan Kumar +2
Code super-optimization is the task of transforming any given program to a more efficient version while preserving its input-output behaviour. In some sense, it is similar to the p…
Efficient Continuous Relaxations for Dense CRF
Alban Desmaison, Rudy Bunel, Pushmeet Kohli +2
Dense conditional random fields (CRF) with Gaussian pairwise potentials have emerged as a popular framework for several computer vision applications such as stereo correspondence a…
Adaptive Neural Compilation
Rudy Bunel, Alban Desmaison, Pushmeet Kohli +2
This paper proposes an adaptive neural-compilation framework to address the problem of efficient program learning. Traditional code optimisation strategies used in compilers are ba…
Large-scale Binary Quadratic Optimization Using Semidefinite Relaxation and Applications
Peng Wang, Chunhua Shen, Anton van den Hengel +1
In computer vision, many problems such as image segmentation, pixel labelling, and scene parsing can be formulated as binary quadratic programs (BQPs). For submodular problems, cut…