RefineStat: Efficient Exploration for Probabilistic Program Synthesis

ICLROral2026

Authors
Madhav Kanda, Shubham Ugare, Sasa Misailovic
Affiliation
University of Illinois at Urbana-Champaign
Venue
ICLR 2026
Track
Oral

TL;DR

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 syn...

Opening excerpt from the authors’ abstract. source

Read the paper

Topics

language model exploration uncertainty efficient

← All ICLR 2026 Oral papers · Browse the whole archive