scholarly journals Optimal Allocation of the Sample in the Poisson Item Count Technique

2018 ◽  
Vol 3 (335) ◽  
pp. 35-47
Author(s):  
Michał Bernardelli ◽  
Barbara Kowalczyk

Indirect methods of questioning are of utmost importance when dealing with sensitive questions. This paper refers to the new indirect method introduced by Tian et al. (2014) and examines the optimal allocation of the sample to control and treatment groups. If determining the optimal allocation is based on the variance formula for the method of moments (difference in means) estimator of the sensitive proportion, the solution is quite straightforward and was given in Tian et al. (2014). However, maximum likelihood (ML) estimation is known from much better properties, therefore determining the optimal allocation based on ML estimators has more practical importance. This problem is nontrivial because in the Poisson item count technique the study sensitive variable is a latent one and is not directly observable. Thus ML estimation is carried out by using the expectation‑maximisation (EM) algorithm and therefore an explicit analytical formula for the variance of the ML estimator of the sensitive proportion is not obtained. To determine the optimal allocation of the sample based on ML estimation, comprehensive Monte Carlo simulations and the EM algorithm have been employed.

Author(s):  
Marzieh Hasannasab ◽  
Johannes Hertrich ◽  
Friederike Laus ◽  
Gabriele Steidl

A Correction to this paper has been published: 10.1007/s11075-021-01156-z


2020 ◽  
Author(s):  
Marie Beisemann ◽  
Ortrud Wartlick ◽  
Philipp Doebler

The Expectation-Maximisation (EM) algorithm is an important numerical method for maximum likelihood estimation in incomplete-data problems. However, convergence of the EM algorithm can be slow, and for this reason, many EM acceleration techniques have been proposed. After a review of acceleration techniques in a unified notation with illustrations, three recently proposed EM acceleration techniques are compared in detail: quasi-Newton methods (QN) (Zhou et al., 2011), "squared" iterative methods (SQUAREM) (Varadhan & Roland, 2004; Roland et al., 2007; Varadhan & Roland, 2008) and parabolic EM (PEM) (Berlinet & Roland, 2009). These acceleration techniques are applied to marginal maximum likelihood estimation with the EM algorithm in one- and two-parameter logistic item response theory (IRT) models for binary data, and their performance is compared. QN and SQUAREM methods accelerate convergence of EM algorithm for the two parameter logistic model significantly in high-dimensional data problems. Compared to standard EM, all three methods reduce the number of iterations, but increase the number of total marginal log-likelihood evaluations per iteration. Efficient approximations of the marginal log-likelihood are hence an important part ofimplementations.


Sign in / Sign up

Export Citation Format

Share Document