论文检索

兼具相关性控制与多维分层的拉丁超立方设计AI 解读

Various methods have been proposed to construct Latin hypercube designs with small correlations. Orthogonal arrays have been used to construct Latin hypercube designs with multi-dimensional stratification. To integrate these two ideas, we propose a method to construct Latin hypercube designs with both controlled correlations and multi-dimensional stratification. For numerical integration, the constructed designs not only filter out lower-dimensional variance components as…

非有限 Fisher 信息与同质性检验：一种 EM 方法AI 解读

Even simple examples of finite mixture models can fail to fulfil the regularity conditions that are routinely assumed in standard parametric inference problems. Many methods have been investigated for testing for homogeneity in finite mixture models, for example, but all rely on regularity conditions including the finiteness of the Fisher information and the space of the mixing parameter being a compact subset of some Euclidean space. Very simple examples where such…

大模型空间下用于模型选择的扩展贝叶斯信息准则AI 解读

The ordinary Bayesian information criterion is too liberal for model selection when the model space is large. In this paper, we re-examine the Bayesian paradigm for model selection and propose an extended family of Bayesian information criteria, which take into account both the number of unknown parameters and the complexity of the model space. Their consistency is established, in particular allowing the number of covariates to increase to infinity with the sample size.…

利用经验似然获得调查回归估计中的范围受限权重AI 解读

Design weights in surveys are often adjusted to accommodate auxiliary information and to meet pre‐specified range restrictions, typically via some ad hoc algorithmic adjustment to a generalised regression estimator. In this paper, we present a simple solution to this problem using empirical likelihood methods or generalised regression. We first develop algorithms for computing empirical likelihood estimators and model‐calibrated empirical likelihood estimators. The first…

一步局部拟似然估计AI 解读

Summary Local quasi-likelihood estimation is a useful extension of local least squares methods, but its computational cost and algorithmic convergence problems make the procedure less appealing, particularly when it is iteratively used in methods such as the back-fitting algorithm, cross-validation and bootstrapping. A one-step local quasi-likelihood estimator is introduced to overcome the computational drawbacks of the local quasi-likelihood method. We demonstrate that as…