Efficient synthesis of probabilistic programs. Nori, A. V, Ozair, S., Rajamani, S. K, Vijaykeerthy, D., Rajamani, S. K, & Vijaykeerthy, D. ACM SIGPLAN Notices, 50(6):208–217, 2015. abstract bibtex Abstract We show how to automatically synthesize probabilistic programs from real-world datasets. Such a synthesis is feasible due to a combination of two techniques:(1) We borrow the idea of``sketching''from synthesis of deterministic programs, and allow the programmer.
@Article{Nori2015,
author = {Nori, Aditya V and Ozair, Sherjil and Rajamani, Sriram K and Vijaykeerthy, Deepak and Rajamani, Sriram K and Vijaykeerthy, Deepak},
title = {Efficient synthesis of probabilistic programs},
journal = {ACM SIGPLAN Notices},
volume = {50},
number = {6},
pages = {208--217},
year = {2015},
abstract = {Abstract We show how to automatically synthesize probabilistic programs from real-world datasets. Such a synthesis is feasible due to a combination of two techniques:(1) We borrow the idea of``sketching\'\'from synthesis of deterministic programs, and allow the programmer.},
location = {New York, New York, USA},
keywords = {}}
Downloads: 0
{"_id":"De6ZFoe9NxxkEidam","bibbaseid":"nori-ozair-rajamani-vijaykeerthy-rajamani-vijaykeerthy-efficientsynthesisofprobabilisticprograms-2015","authorIDs":[],"author_short":["Nori, A. V","Ozair, S.","Rajamani, S. K","Vijaykeerthy, D.","Rajamani, S. K","Vijaykeerthy, D."],"bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Nori"],"firstnames":["Aditya","V"],"suffixes":[]},{"propositions":[],"lastnames":["Ozair"],"firstnames":["Sherjil"],"suffixes":[]},{"propositions":[],"lastnames":["Rajamani"],"firstnames":["Sriram","K"],"suffixes":[]},{"propositions":[],"lastnames":["Vijaykeerthy"],"firstnames":["Deepak"],"suffixes":[]},{"propositions":[],"lastnames":["Rajamani"],"firstnames":["Sriram","K"],"suffixes":[]},{"propositions":[],"lastnames":["Vijaykeerthy"],"firstnames":["Deepak"],"suffixes":[]}],"title":"Efficient synthesis of probabilistic programs","journal":"ACM SIGPLAN Notices","volume":"50","number":"6","pages":"208–217","year":"2015","abstract":"Abstract We show how to automatically synthesize probabilistic programs from real-world datasets. Such a synthesis is feasible due to a combination of two techniques:(1) We borrow the idea of``sketching''from synthesis of deterministic programs, and allow the programmer.","location":"New York, New York, USA","keywords":"","bibtex":"@Article{Nori2015,\nauthor = {Nori, Aditya V and Ozair, Sherjil and Rajamani, Sriram K and Vijaykeerthy, Deepak and Rajamani, Sriram K and Vijaykeerthy, Deepak}, \ntitle = {Efficient synthesis of probabilistic programs}, \njournal = {ACM SIGPLAN Notices}, \nvolume = {50}, \nnumber = {6}, \npages = {208--217}, \nyear = {2015}, \nabstract = {Abstract We show how to automatically synthesize probabilistic programs from real-world datasets. Such a synthesis is feasible due to a combination of two techniques:(1) We borrow the idea of``sketching\\'\\'from synthesis of deterministic programs, and allow the programmer.}, \nlocation = {New York, New York, USA}, \nkeywords = {}}\n\n\n","author_short":["Nori, A. V","Ozair, S.","Rajamani, S. K","Vijaykeerthy, D.","Rajamani, S. K","Vijaykeerthy, D."],"key":"Nori2015","id":"Nori2015","bibbaseid":"nori-ozair-rajamani-vijaykeerthy-rajamani-vijaykeerthy-efficientsynthesisofprobabilisticprograms-2015","role":"author","urls":{},"downloads":0},"bibtype":"article","biburl":"https://gist.githubusercontent.com/stuhlmueller/a37ef2ef4f378ebcb73d249fe0f8377a/raw/6f96f6f779501bd9482896af3e4db4de88c35079/references.bib","creationDate":"2020-01-27T02:13:34.254Z","downloads":0,"keywords":[],"search_terms":["efficient","synthesis","probabilistic","programs","nori","ozair","rajamani","vijaykeerthy","rajamani","vijaykeerthy"],"title":"Efficient synthesis of probabilistic programs","year":2015,"dataSources":["hEoKh4ygEAWbAZ5iy"]}