Tabular : a schema-driven probabilistic programming language

We propose a new kind of probabilistic programming language for machine learning. We write programs simply by annotating existing relational schemas with probabilistic model expressions. We describe a detailed design of our language, Tabular, complete with formal semantics and type system. A rich series of examples illustrates the expressiveness of Tabular. We report an implementation, and show evidence of the succinctness of our notation relative to current best practice. Finally, we describe and verify a transformation of Tabular schemas so as to predict missing values in a concrete database. The ability to query for missing values provides a uniform interface to a wide variety of tasks, including classification, clustering, recommendation, and ranking.

NATURVETENSKAP Data- och informationsvetenskap Datavetenskap hsv//swe
NATURAL SCIENCES Computer and Information Sciences Computer Sciences hsv//eng
Bayesian reasoning; machine learning; model-learner pattern; probabilistic programming; relational data
Datavetenskap
Computer Science

Graepel, Thore (författare)
Rolland, Nicolas (författare)
Russo, Claudio (författare)
Borgström, JohannesUppsala universitet,Datalogi,Mobility(Swepub:uu)johbo484 (författare)
Guiver, John (författare)
Uppsala universitetDatalogi (creator_code:org_t)

Ingår i:Proc. 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming LanguagesNew York : ACM Press, s. 321-3349781450325448

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.