ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Probabilistic programming”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.LGcs.PLEmpiricalRecentAug 5, 2026

PPDL: LLM-Based Flows as Probabilistic Programs

Louis Mandel, Guillaume Baudart, Mandana Vaziri, Martin Hirzel

This paper introduces a probabilistic language for programming large language model-based flows to quantify and propagate uncertainty.

View →
stat.MLcs.LGeess.SPEmpiricalRecentJun 15, 2026

Dynestyx: A Probabilistic Programming Library for Dynamical Systems

Daniel Waxman, Dmitry Batenkov, John Feser, Andy Zane +3 more

A probabilistic programming library, dynestyx, is introduced for Bayesian treatment of dynamical systems.

View →
cs.PLcs.LGTheoreticalRecentJul 8, 2026

GradInf: Gradient Estimation as Probabilistic Inference

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…

View →
stat.MLcs.LGcs.PLTheoreticalRecentAug 9, 2026

LazyHMC: Hamiltonian Monte Carlo Simulation for Lazy, Infinite Dimensional Probabilistic Programs

Maria-Nicoleta Crăciun, C. -H. Luke Ong, Tom Schrijvers, Sam Staton

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…

View →
cs.SEcs.AIcs.PLEmpiricalRecentOct 23, 2026

Responsibility Boundaries for Agentic Systems: A Comparative Evaluation of Probabilistic Agentic Programming

Khadim Lo, Soukaina Alaoui Ismaili, Jean-Sébastien Dessureault

This paper introduces Probabilistic Agentic Programming (PAP) to make responsibility boundaries explicit in language-model agents.

View →
stat.COcs.SEEmpiricalRecentSep 18, 2026

Scentree: a framework for generating scenario trees for multistage stochastic programming

Cristian Pachón-García, Albert Solà Vilalta, F-. Javier Heredia

Scentree is an open-source Python package for constructing scenario trees for multistage stochastic programming from historical data.

View →
cs.SEcs.AIcs.PLEmpiricalRecentOct 27, 2026

ProCerDCL: Query-Efficient Black-Box Probabilistic Verification of Deep Learning Compiler Optimization

Zexin Li, Weibo Zhang, Linyi Li, Arvind Easwaran +1 more

A query-efficient framework for black-box probabilistic verification.

View →
cs.DSmath.PRTheoreticalRecentJul 24, 2026

HyperLogLog for probabilists

Lucas Gerin

This paper provides non-asymptotic and explicit estimates for the exponential deviation inequalities of the HyperLogLog estimator.

View →
cs.PLEmpiricalRecentJun 13, 2026

Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams

Kevin Batz, Daniel Basgöze, Sebastian Junges, Joost-Pieter Katoen

The paper develops typed extended decision diagrams (TEDDs) to improve the scalability of deductive probabilistic program verification.

View →
cs.DSTheoreticalRecentSep 18, 2026

The Complexity of Computing Class Probabilities in BID Probabilistic Databases

Sotiris Kanellopoulos, Ioannis Koutras, Aris Pagourtzis

Computes class probabilities in block-independent disjoint probabilistic databases.

View →
cs.CRcs.AIEmpiricalRecentJun 18, 2026

Efficient and Sound Probabilistic Verification for AI Agents

Alaia Solko-Breslin, Pramod Kaushik Mudrakarta, Mihai Christodorescu, Somesh Jha +1 more

This paper introduces a framework for verifying security policies in AI agents with probabilistic predicates or state transitions.

View →
cs.PLTheoreticalRecentJul 20, 2026

Weakly Non-Negative Supermartingales for Omega-Regular Verification

Toru Takisaka, Hongjie Qing, Libo Zhang

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…

View →
cs.CCcs.LGTheoreticalRecentJun 11, 2026

The Program Is Still There: A Conservation Law for Program Discovery

Jorge Miguel Silva

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…

View →
cs.PLcs.CRTheoreticalRecentOct 10, 2026

(Implicitly) Characterizing Probabilistic Polynomial Time as Used in Cryptography

Ugo Dal Lago, Giulia Giusti

This paper shows that the λBLL calculus can accurately capture polytime computations used in cryptography.

View →
cs.PLTheoreticalRecentJul 28, 2026

The Best of Times, the Worst of Times: Moment-Based Analysis of Probabilistic Cost Structures

Chenyu Zhou, Di Wang, Thomas Reps

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.

View →