Inverting Random Functions III: Discrete MLE Revisited
نویسندگان
چکیده
منابع مشابه
Inverting Random Functions III: Discrete MLE Revisited∗
This paper continues our earlier investigations into the inversion of random functions in a general (abstract) setting. In Section 2, we investigate a concept of invertibility and the invertibility of the composition of random functions defined on finite sets. In Section 3, we resolve some questions concerning the number of samples required to ensure the accuracy of maximum likelihood estimatio...
متن کاملRandom Functions Iii : Discrete Mle
This paper continues our earlier investigations into the inversion of random functions in a general (abstract) setting. In Section 2 we investigate a concept of invertibility and the invertibility of the composition of random functions. In Section 3 we resolve some questions concerning the number of samples required to ensure the accuracy of parametric maximum likelihood estimation (MLE). A dir...
متن کاملInverting random functions
In this paper we study how to invert random functions under different criteria. The motivation for this study is phylogeny reconstruction, since the evolution of biomolecular sequences may be considered as a random function from the set of possible phylogenetic trees to the set of collections of biomolecular sequences of observed species. Our results may effect how we think about the maximum li...
متن کاملInverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications
In this paper we study inverting random functions under the maximum likelihood estimation (MLE) criterion in the discrete setting. In particular, we consider how many independent evaluations of the random function at a particular element of the domain are needed for reliable reconstruction of that element. We provide explicit upper and lower bounds for MLE, both in the nonparametric and paramet...
متن کاملOn Inverting Onto Functions
We study the complexity of inverting many-one, honest, polynomial-time computable onto functions. Asserting that every polynomial-time computable, honest, onto function is invertible is equivalent to the following proposition that we call Q: For all NP machines M that accept , there exists a polynomial-time computable function gM such that for all x, gM(x) outputs an accepting computation of M ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Combinatorics
سال: 2009
ISSN: 0218-0006,0219-3094
DOI: 10.1007/s00026-009-0023-z