Joshua B. Tenenbaum
where else to find them
no profile links on file
what they talk about
all 7 in the filters
where they keep going back
- LAFI3 editions2024–2026
all 6 in the filters
on a stage with
all 25 in the filters
who talks about the same things
- Armando Solar-Lezama18 talks
- Kartik Chandra5 talks
- Jonathan Ragan-Kelley12 talks
- Alexander K. Lew21 talks
- Eric Atkinson6 talks
- Todd Millstein11 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… | ||
| Sequential Monte Carlo Program Synthesis with Refinement Proposals | LAFI 2026 | 2026-01-11 |
Extends program synthesis search to include probabilistic programs and evaluates exact marginal likelihood using the PL change named pluck via lazy knowledge… | ||
| 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… | ||
| A Domain-Specific Probabilistic Programming Language for Reasoning about Reasoning(…) | OOPSLA 2025 | 2025-10-16 |
Memo is a domain-specific probabilistic programming language for recursive theory-of-mind models that compiles to JAX and runs on GPUs. It embeds in Python… | ||
| Gauguin, Descartes, Bayes: A Diurnal Golem's Brain | Onward! 2025 | 2025-10-12 |
Builds a small probabilistic program in Church that samples and conditions over program-space to infer its own source; uses a grammar-based generator, eval… | ||
| Stochastic Lazy Knowledge Compilation for Inference in Discrete Probabilistic Programs | PLDI 2025 | 2025-06-16 |
Implements lazy knowledge compilation in a Julia tool called Pluck and combines it with sequential Monte Carlo that uses locally‑optimal proposals computed… | ||
| A Domain-Specific PPL for Reasoning about Reasoning (or: a memo on memo) | LAFI 2025 | 2025-01-19 |
Introduces memo, a Python-embedded domain-specific PPL that replaces sample/infer with choose/observe semantics and compiles recursive theory-of-mind models… | ||
| Lazy Knowledge Compilation for Discrete PPLs | LAFI 2025 | 2025-01-19 |
A new variant of knowledge compilation for discrete PPLs uses lazy knowledge compilation to delay compiling subexpressions until forced, and it compiles only… | ||
| Toward Probabilistic Coarse-to-Fine Program Synthesis | LAFI 2024 | 2024-01-14 |
Synthesizes programs by starting with coarse probabilistic programs that use randomness as placeholders, then iteratively refines high-entropy expressions into… | ||
| Combining Functional and Automata Synthesis to Discover Causal Reactive Programs | POPL 2023 | 2023-01-15 |
Algorithm converts sequences of video frames plus actions into Autumn programs by iterating functional synthesis (fit per-object update functions from an… | ||
| Top-Down Synthesis for Library Learning | POPL 2023 | 2023-01-15 |
Paper introduces corpus-guided top-down synthesis that builds abstractions by expanding holes and using branch-and-bound pruning with quick upper bounds… | ||
| nothing matches | ||