
TL;DR
This paper extends the concept of projectivity in statistical relational models from domain size to structured data, enabling broader applications and unifying theories across finite and infinite domains.
Contribution
It generalizes projectivity to functors over database data, introduces $\sigma$-projectivity, and unifies finite and infinite domain theories in statistical relational representations.
Findings
Characterization of projective fragments in various formalisms
Representation theorem for projective families of distributions
Unification of finite and infinite domain models
Abstract
The behaviour of statistical relational representations across differently sized domains has become a focal area of research from both a modelling and a complexity viewpoint.Recently, projectivity of a family of distributions emerged as a key property, ensuring that marginal probabilities are independent of the domain size. However, the formalisation used currently assumes that the domain is characterised only by its size. This contribution extends the notion of projectivity from families of distributions indexed by domain size to functors taking extensional data from a database. This makes projectivity available for the large range of applications taking structured input. We transfer key known results on projective families of distributions to the new setting. This includes a characterisation of projective fragments in different statistical relational formalisms as well as a general…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Modeling and Causal Inference · Advanced Database Systems and Queries · Semantic Web and Ontologies
