Probability Model Type Sufficiency
نویسندگان
چکیده
We investigate the role of sufficient statistics in generalized probabilistic data mining and machine learning software frameworks. Some issues involved in the specification of a statistical model type are discussed and we show that it is beneficial to explicitly include a sufficient statistic and functions for its manipulation in the model type’s specification. Instances of such types can then be used by generalized learning algorithms while maintaining optimal learning time complexity. Examples are given for problems such as incremental learning and data partitioning problems (e.g. change-point problems, decision trees and mixture models).
منابع مشابه
Probabilistic Sufficiency and Algorithmic Sufficiency from the point of view of Information Theory
Given the importance of Markov chains in information theory, the definition of conditional probability for these random processes can also be defined in terms of mutual information. In this paper, the relationship between the concept of sufficiency and Markov chains from the perspective of information theory and the relationship between probabilistic sufficiency and algorithmic sufficien...
متن کاملAssessing the Overall Sufficiency of Safety Arguments
Safety cases offer a means for communicating information about the system safety among the system stakeholders. Recently, the requirement for a safety case has been considered by regulators for safety-critical systems. Adopting safety cases is necessarily dependent on the value added for regulatory authorities. In this work, we outline a structured approach for assessing the level of sufficienc...
متن کاملMaximum-entropy from the probability calculus: exchangeability, sufficiency
The classical maximum-entropy principlemethod (Jaynes 1963) appears in the probability calculus as an approximation of a particular model by exchangeability or a particular model by sufficiency. The approximation from the exchangeability model can be inferred from an analysis by Jaynes (1996) and to some extent from works on entropic priors (Rodríguez 1989; 2002; Skilling 1989a; 1990). I tried ...
متن کاملSufficiency and duality for a nonsmooth vector optimization problem with generalized $alpha$-$d_{I}$-type-I univexity over cones
In this paper, using Clarke’s generalized directional derivative and dI-invexity we introduce new concepts of nonsmooth K-α-dI-invex and generalized type I univex functions over cones for a nonsmooth vector optimization problem with cone constraints. We obtain some sufficient optimality conditions and Mond-Weir type duality results under the foresaid generalized invexity and type I cone-univexi...
متن کاملComputational Methods for Evaluating Sequential Tests and Post-test Estimation via the Sufficiency Principle
By the sufficiency principle, the probability density of a sequential test statistic under certain conditions can be factored into a known function that does not depend on the stopping rule and a conditional probability that is free of unknown parameters. We develop general theorems and propose a unified approach to analyzing and evaluating various properties of sequential tests and post-test e...
متن کامل