论文检索

安全自适应重要性抽样：混合分布方法AI 解读

This paper investigates adaptive importance sampling algorithms for which the policy, the sequence of distributions used to generate the particles, is a mixture distribution between a flexible kernel density estimate (based on the previous particles), and a “safe” heavy-tailed density. When the share of samples generated according to the safe density goes to zero but not too quickly, two results are established: (i) uniform convergence rates are derived for the policy toward…

通过最小二乘约束估计进行矩阵秩的自助法检验AI 解读

To test if an unknown matrix M0 has a given rank (null hypothesis noted H0), we consider a statistic that is a squared distance between an estimator and the submanifold of fixed-rank matrix. Under H0, this statistic converges to a weighted chi-squared distribution. We introduce the constrained bootstrap (CS bootstrap) to estimate the law of this statistic under H0. An important point is that even if H0 fails, the CS bootstrap reproduces the behavior of the statistic under…

随机逼近版 EM 算法的收敛性AI 解读

The expectation-maximization (EM) algorithm is a powerful computational technique for locating maxima of functions. It is widely used in statistics for maximum likelihood or maximum a posteriori estimation in incomplete data models. In certain situations, however, this method is not applicable because the expectation step cannot be performed in closed form. To deal with these problems, a novel method is introduced, the stochastic approximation EM (SAEM), which replaces the…