A note on the investigation of local and global identifiability

In general, nonlinear models such as those commonly employed for the analysis of covariance structures, are not globally identifiable. Any investigation of local identifiability must either yield a mapping of identifiability onto the entire parameter space, which will rarely be feasible in any applications of interest, or confine itself to the neighbourhood of such points of special interest as the maximum likelihood point.The author would like to thank J. Jack McArdle and Colin Fraser for their comments on this paper.     

The use of latent class models for assessing prerequisite relations and transference among traits

This paper presents a strategy for pairwise assessment which may be used to evaluate the nature of both prerequisite and transference relations existing among a set of traits. This strategy is appropriate for use both within a confirmatory context, in which an attempt is made to establish the validity of some specified set of relations among traits, as well as within an exploratory context, in which a search is made for unconjectured prerequisite and transference relations existing between pairs of traits. Both uses of this strategy are based on a variety of latent class models which are representative of various possible relational states existing between pairs of traits. Thus, the nature of trait relations may be investigated through the use of statistical assessments of both absolute and relative fit attained by these models. An application is presented to exemplify how this strategy may be used within the exploratory context.The author is obliged to Clifford Clogg, C. Mitchell, Dayton, and William Schafer for helpful comments made regarding a previous draft of this paper as well as to Mary Papageorgiou who provided access to the data which was considered in this study.     

On Herrnstein's equation and related forms

In 1970, Herrnstein proposed a simple equation to describe the relation between response and reinforcement rates on interval schedules. Its empirical basis is firm, but its theoretical foundation is still uncertain. Two approaches to the derivation of Herrnstein's equation are discussed. It can be derived as the equilibrium solution to a process model equivalent to familiar linear-operator learning models. Modifications of this approach yield competing power-function formulations. The equation can also be derived from the assumption that response strength is proportional to reinforcement rate, given that there is a ceiling on response rate. The proportional relation can, in turn, be derived from a threshold assumption equivalent to Shimp's “momentary maximizing”. This derivation implies that the two parameters of Herrnstein's equation should be correlated, and may explain its special utility in application to internal schedules.     

Transformation of a three-mode multidimensional scaling solution to indscal form

Relations between Tucker's three-mode multidimensional scaling and Carroll and Chang's INDSCAL are discussed. The possibility is raised that it may be profitable to attempt to transform a three-mode solution to the general form of an INDSCAL solution. Operationally, this involves transforming the three-mode core matrix so that each section is, as nearly as possible, a diagonal matrix. A technique is developed for accomplishing such a transformation, and is applied to two sets of data from the literature. Results indicate that the process is both feasible and valuable, providing useful information on the relative appropriateness of the two models.     

Speaker identification using multi-modal i-vector approach for varying length speech in voice interactive systems

The development in the interface of smart devices has lead to voice interactive systems. An additional step in this direction is to enable the devices to recognize the speaker. But this is a challenging task because the interaction involves short duration speech utterances. The traditional Gaussian mixture models (GMM) based systems have achieved satisfactory results for speaker recognition only when the speech lengths are sufficiently long. The current state-of-the-art method utilizes i-vector based approach using a GMM based universal background model (GMM-UBM). It prepares an i-vector speaker model from a speaker’s enrollment data and uses it to recognize any new test speech. In this work, we propose a multi-model i-vector system for short speech lengths. We use an open database THUYG-20 for the analysis and development of short speech speaker verification and identification system. By using an optimum set of mel-frequency cepstrum coefficients (MFCC) based features we are able to achieve an equal error rate (EER) of 3.21% as compared to the previous benchmark score of EER 4.01% on the THUYG-20 database. Experiments are conducted for speech lengths as short as 0.25 s and the results are presented. The proposed method shows improvement as compared to the current i-vector based approach for shorter speech lengths. We are able to achieve improvement of around 28% even for 0.25 s speech samples. We also prepared and tested the proposed approach on our own database with 2500 speech recordings in English language consisting of actual short speech commands used in any voice interactive system.     

A new framework for modeling decisions about changing information: The Piecewise Linear Ballistic Accumulator model

In the real world, decision making processes must be able to integrate non-stationary information that changes systematically while the decision is in progress. Although theories of decision making have traditionally been applied to paradigms with stationary information, non-stationary stimuli are now of increasing theoretical interest. We use a random-dot motion paradigm along with cognitive modeling to investigate how the decision process is updated when a stimulus changes. Participants viewed a cloud of moving dots, where the motion switched directions midway through some trials, and were asked to determine the direction of motion. Behavioral results revealed a strong delay effect: after presentation of the initial motion direction there is a substantial time delay before the changed motion information is integrated into the decision process. To further investigate the underlying changes in the decision process, we developed a Piecewise Linear Ballistic Accumulator model (PLBA). The PLBA is efficient to simulate, enabling it to be fit to participant choice and response-time distribution data in a hierarchal modeling framework using a non-parametric approximate Bayesian algorithm. Consistent with behavioral results, PLBA fits confirmed the presence of a long delay between presentation and integration of new stimulus information, but did not support increased response caution in reaction to the change. We also found the decision process was not veridical, as symmetric stimulus change had an asymmetric effect on the rate of evidence accumulation. Thus, the perceptual decision process was slow to react to, and underestimated, new contrary motion information.     

How a high working memory capacity can increase proactive interference

Previous findings suggested that a high working memory capacity (WMC) is potentially associated with a higher susceptibility to proactive interference (PI) if the latter is measured under high cognitive load. To explain such a finding, we propose to consider susceptibility to PI as a net effect of individual executive processes and the intrinsic potential for PI. With the latter, we refer to the amount of information that is activated at a given time and that has the potential to exert PI subsequently. In two studies deploying generalized linear mixed models, susceptibility to PI was modeled as the decline of performance over trials of a complex span task. The results revealed that a higher WMC was associated with a higher susceptibility to PI. Moreover, the number of stimuli recalled in one trial as a proxy variable for the intrinsic potential for PI negatively affected memory performance in the subsequent trial.     

A note on computing Louis’ observed information matrix identity for IRT and cognitive diagnostic models

Using Louis’ formula, it is possible to obtain the observed information matrix and the corresponding large-sample standard error estimates after the expectation–maximization (EM) algorithm has converged. However, Louis’ formula is commonly de-emphasized due to its relatively complex integration representation, particularly when studying latent variable models. This paper provides a holistic overview that demonstrates how Louis’ formula can be applied efficiently to item response theory (IRT) models and other popular latent variable models, such as cognitive diagnostic models (CDMs). After presenting the algebraic components required for Louis’ formula, two real data analyses, with accompanying numerical illustrations, are presented. Next, a Monte Carlo simulation is presented to compare the computational efficiency of Louis’ formula with previously existing methods. Results from these presentations suggest that Louis’ formula should be adopted as a standard method when computing the observed information matrix for IRT models and CDMs fitted with the EM algorithm due to its computational efficiency and flexibility.