activity
20112025
most citedLearning Disentangled Representations with Semi-Supervised Deep Generative Models

140 citations · 526 across the 24 of their papers we have counts for

collaborators
Showing cs.LGShow all

14 papers · 1 filter

cs.LG2025

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…

cs.LG2025★ 3 cited

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…

cs.LG2024

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…

cs.LG2023

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…

cs.LG2022★ 20 cited

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…

cs.LG2021★ 16 cited

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…

cs.LG2021★ 5 cited

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…

cs.LG2020

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…

cs.LG2020★ 8 cited

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…

cs.LG2019★ 4 cited

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…

cs.LG2019★ 41 cited

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…

cs.LG2019★ 28 cited

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…

cs.LG2016★ 1 cited

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…

cs.LG2016★ 17 cited

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…