activity
20182023
most citedSimplifying Dependent Reductions in the Polyhedral Model

6 citations · 15 across the 5 of their papers we have counts for

collaborators

7 papers

cs.PL2023

Verifying Performance Properties of Probabilistic Inference

Eric Atkinson, Ellie Y. Cheng, Guillaume Baudart +2

In this extended abstract, we discuss the opportunity to formally verify that inference systems for probabilistic programming guarantee good performance. In particular, we focus on…

cs.PL2022

Semi-Symbolic Inference for Efficient Streaming Probabilistic Programming

Eric Atkinson, Charles Yuan, Guillaume Baudart +2

Efficient inference is often possible in a streaming context using Rao-Blackwellized particle filters (RBPFs), which exactly solve inference problems when possible and fall back on…

cs.PL2021★ 5 cited

Statically Bounded-Memory Delayed Sampling for Probabilistic Streams

Eric Atkinson, Guillaume Baudart, Louis Mandel +2

Probabilistic programming languages aid developers performing Bayesian inference. These languages provide programming constructs and tools for probabilistic modeling and automated…

cs.PL2021★ 4 cited

Programming and Reasoning with Partial Observability

Eric Atkinson, Michael Carbin

Computer programs are increasingly being deployed in partially-observable environments. A partially observable environment is an environment whose state is not completely visible t…

cs.PL2020★ 6 cited

Simplifying Dependent Reductions in the Polyhedral Model

Cambridge Yang, Eric Atkinson, Michael Carbin

A Reduction -- an accumulation over a set of values, using an associative and commutative operator -- is a common computation in many numerical computations, including scientific c…

cs.PL2019

Reactive Probabilistic Programming

Guillaume Baudart, Louis Mandel, Eric Atkinson +3

Synchronous modeling is at the heart of programming languages like Lustre, Esterel, or Scade used routinely for implementing safety critical control software, e.g., fly-by-wire and…