Asymptotic elimination of partially continuous aggregation functions in directed graphical models
share
In Statistical Relational Artificial Intelligence, a branch of AI and machine learning which combines the logical and statistical schools of AI, one uses the concept parametrized probabilistic graphical model (PPGM) to model (conditional) dependencies between random variables and to make probabilistic inferences about events on a space of "possible worlds". The set of possible worlds with underlying domain D (a set of objects) can be represented by the set 𝐖_D of all first-order structures (for a suitable signature) with domain D. Using a formal logic we can describe events on 𝐖_D. By combining a logic and a PPGM we can also define a probability distribution ℙ_D on 𝐖_D and use it to compute the probability of an event. We consider a logic, denoted PLA, with truth values in the unit interval, which uses aggregation functions, such as arithmetic mean, geometric mean, maximum and minimum instead of quantifiers. However we face the problem of computational efficiency and this problem is an obstacle to the wider use of methods from Statistical Relational AI in practical applications. We address this problem by proving that the described probability will, under certain assumptions on the PPGM and the sentence φ, converge as the size of D tends to infinity. The convergence result is obtained by showing that every formula φ(x_1, …, x_k) which contains only "admissible" aggregation functions (e.g. arithmetic and geometric mean, max and min) is asymptotically equivalent to a formula ψ(x_1, …, x_k) without aggregation functions.
READ FULL TEXT