SweetPea: A Language for Designing Experiments
We introduce SweetPea, a SAT-sampler aided language that addresses problems scientists face when creating randomized experimental designs. SweetPea provides a high-level interface to declaratively describe an experimental design, and a low-level synthesizer to generate unbiased sequences of trials given satisfiable constraints. Our prototype provides a rich set of primitives that closely match natural descriptions of experimental designs, allowing researchers to concisely describe what analysis they wish to perform. To ensure statistically significant results, every possible sequence of trials that satisfies the design must have an equal likelihood of being chosen for the experiment. SweetPea samples sequences of trials by compiling experimental designs into Boolean logic, which are then passed to a SAT-sampler. The SAT-sampler Unigen provides statistical guarantees that the solutions it finds are approximately uniformly probable in the space of all valid solutions.
Abstract (obt18-paper13.pdf) | 361KiB |
Sat 13 Jan Times are displayed in time zone: Tijuana, Baja California change
13:30 - 15:30: Session 2Off the Beaten Track at Crocker Chair(s): William E. ByrdUniversity of Alabama at Birmingham, USA | |||
13:30 - 14:00 Lunch | Lunch (12pm-2pm) Off the Beaten Track | ||
14:00 - 14:30 Talk | SweetPea: A Language for Designing Experiments Off the Beaten Track Annie CherkaevUniversity of Utah, Sebastian MusslickPrinceton University, Jonathan CohenPrinceton University, Vivek SrikumarUniversity of Utah, Matthew FlattUniversity of Utah File Attached | ||
14:30 - 15:00 Talk | Extensible Semantics for Fluidics Off the Beaten Track File Attached | ||
15:00 - 15:30 Talk | Towards Proof Synthesis by Neural Machine Translation Off the Beaten Track Taro SekiyamaIBM Research, Japan, Akifumi ImanishiKyoto University, Kohei SuenagaGraduate School of Informatics, Kyoto University File Attached |