نتایج جستجو برای: fisher information matrix
تعداد نتایج: 1496621 فیلتر نتایج به سال:
To prove Eq. (S1) we recall that the square root of the positive definite Fisher matrix is given by the matrix with the same (orthonormal) eigenvectors as F and the square root of its eigenvalues. We indicate as fi > 0 and vi (with v> i vj = δi,j) the eigenvalues and eigenvectors of F, respectively (Fvi = fivi). Notice that F is real and symmetric and thus diagonalize. In addition, F is positiv...
We revisit the problem of computing submatrices of the Cramér-Rao bound (CRB), which lower bounds the variance of any unbiased estimator of a vector parameter θ. We explore iterative methods that avoid direct inversion of the Fisher information matrix, which can be computationally expensive when the dimension of θ is large. The computation of the bound is related to the quadratic matrix program...
We propose an active learning method with hidden-unit reduction, which is devised specially for multilayer perceptrons (MLP). First, we review our active learning method, and point out that many Fisher-information-based methods applied to MLP have a critical problem: the information matrix may be singular. To solve this problem, we derive the singularity condition of an information matrix, and ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید