AI RESEARCH
RefineStat: Efficient Exploration for Probabilistic Program Synthesis
arXiv CS.LG
•
ArXi:2509.01082v3 Announce Type: replace Probabilistic programming offers a powerful framework for modeling uncertainty, yet statistical model discovery in this domain entails navigating an immense search space under strict domain-specific constraints. When small language models are tasked with generating probabilistic programs, they frequently produce outputs that suffer from both syntactic and semantic errors, such as flawed inference constructs. Motivated by probabilistic programmers' domain expertise and debugging strategies, we.