Demo Data from VLDB 2026 / reviewers in the wild / expert
George Matheos
dblp:349/4333
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0006-5293-9521ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Software engineering, system software, and programming languages
1 paper |
Compilers and program optimization · 56% Programming languages and type systems · 44% | |
| Artificial intelligence
1 paper |
Probabilistic and Bayesian machine learning · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning
probabilistic programming |
1.0 | 1 | 2026 | Probabilistic Programming with Vectorized Programmable Inference · Proc. ACM Program. Lang. 2026 |
Programming languages and type systems › probabilistic programming
probabilistic programming language |
1.0 | 1 | 2026 | Probabilistic Programming with Vectorized Programmable Inference · Proc. ACM Program. Lang. 2026 |
Compilers and program optimization
program transformation |
1.0 | 1 | 2026 | Probabilistic Programming with Vectorized Programmable Inference · Proc. ACM Program. Lang. 2026 |
Compilers and program optimization › program transformation
source-to-source transformation |
0.3 | 1 | 2026 | Probabilistic Programming with Vectorized Programmable Inference · Proc. ACM Program. Lang. 2026 |
Methods — techniques the papers use, named apart from their topics
vectorizing map · 2.0automatic differentiation · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Probabilistic Programming with Vectorized Programmable InferenceabstractWe present GenJAX, a new language and compiler for vectorized programmable probabilistic inference. GenJAX integrates the vectorizing map (vmap) operation from array programming frameworks such as JAX into the programmable inference paradigm, enabling compositional vectorization of features such as probabilistic program traces, stochastic branching (for expressing mixture models), and programmable inference interfaces for writing custom probabilistic inference algorithms. We formalize vectorization as a source-to-source program transformation on a core calculus for probabilistic programming ( λ GEN ), and prove that it correctly vectorizes both modeling and inference operations. We have implemented our approach in the GenJAX language and compiler, and have empirically evaluated this implementation on several benchmarks and case studies. Our results show that our implementation supports a wide and expressive set of programmable inference patterns and delivers performance comparable to hand-optimized JAX code. McCoy R. Becker, Mathieu Huot, George Matheos, Karen Chung, Sam Ritchie, Rif A. Saurous, Alexander K. Lew, Martin C. Rinard, Vikash Mansinghka 0001 |
Proc. ACM Program. Lang. | 3 |
| 2023 | SMCP3: Sequential Monte Carlo with Probabilistic Program ProposalsabstractThis paper introduces SMCP3, a method for automatically implementing custom sequential Monte Carlo samplers for inference in probabilistic programs. Unlike particle filters and resample-move SMC (Gilks and Berzuini, 2001), SMCP3 algorithms can improve the quality of samples and weights using pairs of Markov proposal kernels that are also specified by probabilistic programs. Unlike Del Moral et al. (2006b), these proposals can themselves be complex probabilistic computations that generate auxiliary variables, apply deterministic transformations, and lack tractable marginal densities. This paper also contributes an efficient implementation in Gen that eliminates the need to manually derive incremental importance weights. SMCP3 thus simultaneously expands the design space that can be explored by SMC practitioners and reduces the implementation effort. SMCP3 is illustrated using applications to 3D object tracking, state-space modeling, and data clustering, showing that SMCP3 methods can simultaneously improve the quality and reduce the cost of marginal likelihood estimation and posterior inference. Alexander K. Lew, George Matheos, Tan Zhi-Xuan, Matin Ghavamizadeh, Nishad Gothoskar, Stuart Russell 0001, Vikash Mansinghka 0001 |
AISTATS | 2 |