Relational Marginal Problems: Theory and Estimation
نویسندگان
چکیده
In the propositional setting, the marginal problem is to find a (maximum-entropy) distribution that has some given marginals. We study this problem in a relational setting and make the following contributions. First, we compare two different notions of relational marginals. Second, we show a duality between the resulting relational marginal problems and the maximum likelihood estimation of the parameters of relational models, which generalizes a well-known duality from the propositional setting. Third, by exploiting the relational marginal formulation, we present a statistically sound method to learn the parameters of relational models that will be applied in settings where the number of constants differs between the training and test data. Furthermore, based on a relational generalization ofmarginal polytopes, we characterize cases where the standard estimators based on feature’s number of true groundings needs to be adjusted and we quantitatively characterize the consequences of these adjustments. Fourth, we prove bounds on expected errors of the estimated parameters, which allows us to lower-bound, among other things, the effective sample size of relational training data.
منابع مشابه
Tree and local computations in a cross-entropy minimization problem with marginal constraints
In probability theory, Bayesian statistics, artificial intelligence and database theory the minimum cross-entropy principle is often used to estimate a distribution with a given set P of marginal distributions under the proportionality assumption with respect to a given “prior” distribution q. Such an estimation problem admits a solution if and only if there exists an extension of P that is dom...
متن کاملVariational Algorithms for Marginal MAP
The marginal maximum a posteriori probability (MAP) estimation problem, which calculates the mode of the marginal posterior distribution of a subset of variables with the remaining variables marginalized, is an important inference problem in many models, such as those with hidden variables or uncertain parameters. Unfortunately, marginal MAP can be NP-hard even on trees, and has attracted less ...
متن کاملMarginal MAP estimation using Markov chain Monte Carlo
Markov chain Monte Carlo (MCMC) methods are powerful simulation-based techniques for sampling from high-dimensional and/or non-standard probability distributions. These methods have recently become very popular in the statistical and signal processing communities as they allow highly complex inference problems in detection and estimation to be addressed. However, MCMC is not currently well adap...
متن کاملHoeffding Inequalities for Join Selectivity Estimation and Online Aggregation
We extend Hoe ding s inequalities for simple averages of random variables to the case of cross product averages We also survey some new and existing Hoe ding inequalities for estimators of the mean variance and standard deviation of a subpopulation These results are applicable to two problems in object relational database management systems xed precision estimation of the selectivity of a join ...
متن کاملApplying Marginal MAP Search to Probabilistic Conformant Planning: Initial Results
In this position paper, we present our current progress in applying marginal MAP algorithms for solving the conformant planning problems. Conformant planning problem is formulated as probabilistic inference in graphical models compiled from relational PPDDL domains. The translation from PPDDL into Dynamic Bayesian Network is developed by mapping the SAT encoding of the ground PPDDL into factore...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1709.05825 شماره
صفحات -
تاریخ انتشار 2017