Fabian Zaiser
where else to find them
no profile links on file
what they talk about
all 6 in the filters
where they keep going back
- LAFI4 editions2022–2026
all 6 in the filters
on a stage with
all 27 in the filters
who talks about the same things
- Jack Czenszak4 talks
- Martin C. Rinard12 talks
- Alexander K. Lew21 talks
- Vikash K. Mansinghka24 talks
- C.-H. Luke Ong14 talks
- Jianlin Li3 talks
| title | conference | date |
|---|---|---|
| Event-based Design Abstractions for Agent Harnesses | PAgE 2026 | 2026-06-15 |
Proposes an event-driven harness where a durable append-only event log is the single source of truth, with independent facets that fold over the log to derive… | ||
| Incremental Computation for Efficient Programmable Inference in Probabilistic Programs | PLDI 2026 | 2026-06-15 |
Compiles probabilistic programs to deterministic density functions, then applies a compositional incrementalization based on the incremental lambda calculus… | ||
| Incremental Density Computation for Efficient Programmable Inference | LAFI 2026 | 2026-01-11 |
Presents a concrete workflow: compute trace types from the probabilistic program, use type-directed change types to represent insertions/removals/replacements… | ||
| Language-Model Probabilistic Programming for Improving Autoformalization via Cycle(…) | LAFI 2026 | 2026-01-11 |
Proposes a GenLM-based decoder that steers a 70B LLM with two real-valued potentials: incremental type-checking via Lean by affixing dummy conclusions at safe… | ||
| Guaranteed Bounds on Posterior Distributions of Discrete Probabilistic Programs with Loops | POPL 2025 | 2025-01-19 |
Automated tool Diabolo implements two provable methods: residual mass semantics (fast unrolling upper/lower bounds) and geometric bound semantics (contraction… | ||
| Guaranteed Bounds for Discrete Probabilistic Programs with Loops via Generating ... | LAFI 2024 | 2024-01-14 |
Technique finds guaranteed upper and lower bounds on the posterior of discrete probabilistic programs with unbounded loops by representing distributions as… | ||
| VMC: a Dafny Library for Verified Monte Carlo Algorithms | Dafny 2024 | 2024-01-14 |
Open-source Dafny library that provides verified Monte Carlo samplers: each sampler has a bitstream-to-value functional model, a machine-checked proof that the… | ||
| Exact Inference for Discrete Probabilistic Programs via Generating Functions | LAFI 2023 | 2023-01-15 |
Exact inference method represents program state distributions with probability generating functions and transforms those closed-form PGFs across sampling… | ||
| Nonparametric Involutive Markov Chain Monte Carlo | LAFI 2022 | 2022-01-16 |
Framework generalizes involutive MCMC to universal PPLs and implements a concrete fix for trans‑dimensional moves: it appends samples until proposal has… | ||
| Rigorous Approximation of Posterior Inference for Probabilistic Programs | LAFI 2022 | 2022-01-16 |
Claims rigorous, nonstochastic posterior bounds for a universal probabilistic language that allows recursion, continuous distributions and conditioning. Method… | ||
| Lightning Talks | BazelCon 2017 | 2017-11-06 |
Nine five-minute updates cover tools, migrations, and proposals: buildifier/builder formats and programmatically edits BUILD files; a Skylark linter flags… | ||
| nothing matches | ||