Search Results for author: Mathieu Huot

Found 6 papers, 1 papers with code

Probabilistic Programming with Programmable Variational Inference

no code implementations22 Jun 2024 McCoy R. Becker, Alexander K. Lew, Xiaoyan Wang, Matin Ghavami, Mathieu Huot, Martin C. Rinard, Vikash K. Mansinghka

Compared to the wide array of advanced Monte Carlo methods supported by modern probabilistic programming languages (PPLs), PPL support for variational inference (VI) is less developed: users are typically limited to a predefined selection of variational objectives and gradient estimators, which are implemented monolithically (and without formal correctness arguments) in PPL backends.

Probabilistic Programming Variational Inference

Differentiating Metropolis-Hastings to Optimize Intractable Densities

1 code implementation13 Jun 2023 Gaurav Arya, Ruben Seyer, Frank Schäfer, Kartik Chandra, Alexander K. Lew, Mathieu Huot, Vikash K. Mansinghka, Jonathan Ragan-Kelley, Christopher Rackauckas, Moritz Schauer

We develop an algorithm for automatic differentiation of Metropolis-Hastings samplers, allowing us to differentiate through probabilistic inference, even if the model has discrete components within it.

$\nabla$SD: Differentiable Programming for Sparse Tensors

no code implementations13 Mar 2023 Amir Shaikhha, Mathieu Huot, Shideh Hashemian

Sparse tensors are prevalent in many data-intensive applications, yet existing differentiable programming frameworks are tailored towards dense tensors.

$ω$PAP Spaces: Reasoning Denotationally About Higher-Order, Recursive Probabilistic and Differentiable Programs

no code implementations21 Feb 2023 Mathieu Huot, Alexander K. Lew, Vikash K. Mansinghka, Sam Staton

We introduce a new setting, the category of $\omega$PAP spaces, for reasoning denotationally about expressive differentiable and probabilistic programming languages.

Probabilistic Programming

Functional Collection Programming with Semi-Ring Dictionaries

no code implementations10 Mar 2021 Amir Shaikhha, Mathieu Huot, Jaclyn Smith, Dan Olteanu

We developed SDQL, a statically typed language that can express relational algebra with aggregations, linear algebra, and functional collections over data such as relations and matrices using semi-ring dictionaries.

Cannot find the paper you are looking for? You can Submit a new open access paper.