20 results for “Probabilistic programming”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper introduces a probabilistic language for programming large language model-based flows to quantify and propagate uncertainty.
Daniel Waxman, Dmitry Batenkov, John Feser, Andy Zane +3 more
A probabilistic programming library, dynestyx, is introduced for Bayesian treatment of dynamical systems.
Gaurav Arya, Mathieu Huot, Moritz Schauer, Alexander K. Lew +1 more
This paper introduces gradient inference, a new approach to developing sound and efficient gradient estimators for probabilistic programs by reducing gradient estimation to a related probabilistic inf…
This paper develops new formulations of Hamiltonian Monte Carlo (HMC) for infinite-dimensional parameter spaces in Haskell using lazy evaluation, providing analysis for automatic differentiation and M…
This paper introduces Probabilistic Agentic Programming (PAP) to make responsibility boundaries explicit in language-model agents.
Scentree is an open-source Python package for constructing scenario trees for multistage stochastic programming from historical data.
Zexin Li, Weibo Zhang, Linyi Li, Arvind Easwaran +1 more
A query-efficient framework for black-box probabilistic verification.
This paper provides non-asymptotic and explicit estimates for the exponential deviation inequalities of the HyperLogLog estimator.
The paper develops typed extended decision diagrams (TEDDs) to improve the scalability of deductive probabilistic program verification.
Computes class probabilities in block-independent disjoint probabilistic databases.
This paper introduces a framework for verifying security policies in AI agents with probabilistic predicates or state transitions.
The paper introduces lazy Streett supermartingales and their lexicographic extension to certify almost-sure satisfaction of omega-regular properties with polynomial templates under a broad class of sa…
This paper measures the lower bound for the shortest program generating a sequence, proving a conservation law and providing a deterministic engine to recover generating programs for certain sequences…
This paper shows that the λBLL calculus can accurately capture polytime computations used in cryptography.
This paper presents a compositional cost analysis for probabilistic programs with hierarchical cost structures, allowing computation of mean and higher moments of non-additive costs.