Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
Probabilistic Programming with Programmable Variational Inference
- McCoy R. Becker,
- Alexander K. Lew,
- Xiaoyan Wang,
- Matin Ghavami,
- Mathieu Huot,
- Martin C. Rinard,
- Vikash K. Mansinghka
Proceedings of the ACM on Programming Languages (PACMPL), Volume 8, Issue PLDIArticle No.: 233, Pages 2123–2147https://doi.org/10.1145/3656463Compared 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 ...
GenSQL: A Probabilistic Programming System for Querying Generative Models of Database Tables
- Mathieu Huot,
- Matin Ghavami,
- Alexander K. Lew,
- Ulrich Schaechtle,
- Cameron E. Freer,
- Zane Shelby,
- Martin C. Rinard,
- Feras A. Saad,
- Vikash K. Mansinghka
Proceedings of the ACM on Programming Languages (PACMPL), Volume 8, Issue PLDIArticle No.: 179, Pages 790–815https://doi.org/10.1145/3656409This article presents GenSQL, a probabilistic programming system for querying probabilistic generative models of database tables. By augmenting SQL with only a few key primitives for querying probabilistic models, GenSQL enables complex Bayesian ...
- research-articleSeptember 2024
A Tensor Algebra Compiler for Sparse Differentiation
CGO '24: Proceedings of the 2024 IEEE/ACM International Symposium on Code Generation and OptimizationPages 1–12https://doi.org/10.1109/CGO57630.2024.10444787Sparse tensors are prevalent in many data-intensive applications. However, existing automatic differentiation (AD) frameworks are tailored towards dense tensors, which makes it a challenge to efficiently compute gradients through sparse tensor ...
Compiling Structured Tensor Algebra
Proceedings of the ACM on Programming Languages (PACMPL), Volume 7, Issue OOPSLA2Article No.: 229, Pages 204–233https://doi.org/10.1145/3622804Tensor algebra is essential for data-intensive workloads in various computational domains. Computational scientists face a trade-off between the specialization degree provided by dense tensor algebra and the algorithmic efficiency that leverages the ...
- research-articleJanuary 2023
ADEV: Sound Automatic Differentiation of Expected Values of Probabilistic Programs
Proceedings of the ACM on Programming Languages (PACMPL), Volume 7, Issue POPLArticle No.: 5, Pages 121–153https://doi.org/10.1145/3571198Optimizing the expected values of probabilistic processes is a central problem in computer science and its applications, arising in fields ranging from artificial intelligence to operations research to statistical computing. Unfortunately, automatic ...
- research-articleApril 2022
Functional collection programming with semi-ring dictionaries
Proceedings of the ACM on Programming Languages (PACMPL), Volume 6, Issue OOPSLA1Article No.: 89, Pages 1–33https://doi.org/10.1145/3527333This paper introduces semi-ring dictionaries, a powerful class of compositional and purely functional collections that subsume other collection types such as sets, multisets, arrays, vectors, and matrices. We developed SDQL, a statically typed language ...
- ArticleApril 2020
Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing
Foundations of Software Science and Computation StructuresPages 319–338https://doi.org/10.1007/978-3-030-45231-5_17AbstractWe present semantic correctness proofs of Automatic Differentiation (AD). We consider a forward-mode AD method on a higher order language with algebraic data types, and we characterise it as the unique structure preserving macro given a choice of ...
- research-articleJune 2021
Quantum channels as a categorical completion
LICS '19: Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer ScienceArticle No.: 35, Pages 1–13We propose a categorical foundation for the connection between pure and mixed states in quantum information and quantum computation. The foundation is based on distributive monoidal categories.
First, we prove that the category of all quantum channels ...