~/talk

Sandwood: Runtime Adaptable Probabilistic Programming for Java

Talkat LAFI 2025 · on Sunday, 2025-01-19· [java]
links:none on file
links:none on file
links:none on file
slides:none on file

Sandwood is an open‑source Java‑like probabilistic programming language, compiler and runtime that compiles models to Java classes whose instances can switch execution backends at runtime and copy state between them. It runs single‑threaded, on ForkJoin and on Oracle’s Kalisto runtime, with plans for Java Vector API and GPU via ARA. It handles array‑index dependent DAGs by building traces with scope constructors that generate guarded nested loops and then optimizes them down; example workflow records MAP results after 2,000 sampling steps.

AI-written summary · about

  1. 0:00Introduction
  2. 2:28Design goals
  3. 3:31Sandwood model structure
  4. 5:36Using Sandwood in practice
  5. 7:01Model construction challenges
  6. 11:36Optimizing relationships
  7. 13:21Sampling distributions
  8. 13:42Conclusion and future work
  9. 14:08Q&A
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.