1 code implementation • 1 Mar 2024 • A. Hovhannisyan, A. E. Allahverdyan
Thus, for the minimal common cause, one should choose the option of Simpson's paradox that assumes conditioning over $B$ and not its marginalization.
no code implementations • 30 Jun 2023 • A. Hovhannisyan, A. E. Allahverdyan
We show that the generalized maximum likelihood method can be applied to this situation and allows identification of $C$ that is consistent with the common cause principle.
no code implementations • 17 Dec 2020 • A. E. Allahverdyan, N. H. Martirosyan
Here we study MAXENT in a Bayesian decision theory set-up, i. e. assuming that there exists a well-defined prior Dirichlet density for unknown probabilities, and that the average Kullback-Leibler (KL) distance can be employed for deciding on the quality and applicability of various estimators.
no code implementations • 18 Feb 2020 • A. E. Allahverdyan
We study the parameter estimation problem in mixture models with observational nonidentifiability: the full model (also containing hidden variables) is identifiable, but the marginal (observed) model is not.
no code implementations • 6 Sep 2013 • W. B. Deng, A. E. Allahverdyan, B. Li, Q. A. Wang
The scenario of its validity is similar to the Zipf's law for words in short English texts.