For simple prospects routinely used for certainty equivalent elicitation, random expected utility preferences imply a conditional expectation function that can mimic deterministic rank-dependent preferences. That is, a subject with random expected utility preferences can have expected certainty equivalents exactly like those predicted by rank-dependent probability weighting functions of the inverse-s shape discussed by Quiggin (J Econ Behav Organ 3:323–343, 1982) and advocated by Tversky and Kahneman (J Risk Uncertainty 5:297–323, 1992), Prelec (Econometrica 66:497–527, 1998) and other scholars. Certainty equivalents may not nonparametrically identify preferences: Their conditional expectation (and critically, their interpretation) depends on assumptions concerning the source of their variability.

In this note, we prove that the 3 parameter logistic model with fixed-effect abilities is identified only up to a linear transformation of the ability scale under mild regularity conditions, contrary to the claims in Theorem 2 of San Martín et al. (Psychometrika, 80(2):450–467, 2015a).

The notion of scale freeness does not seem to have been well understood in the factor analytic literature. It has been believed that if the loss function that is minimized to obtain estimates of the parameters in the factor model is scale invariant, then the estimates are scale free. It is shown that scale invariance of the loss function is neither a necessary nor a sufficient condition for scale freeness. A theorem that ensures scale freeness in the orthogonal factor model is given in this paper.

By reference to nominated attributes, a genus, being a population of objects of one specified kind, may be partitioned into species, being subpopulations of different kinds. A prototype is an object representative of its species within the genus. Using this framework, the paper describes how objects can be relatively differentiated with respect to attributes, and how attributes can be relatively differentiating with respect to objects. Methods and rationale for such differential ordering of objects and attributes are presented by example, formal development, and application.

For a genus Ω comprising n species of object there is a subset P ofn distinct prototypes. With respect to m nominated attributes, each object in Ω has an m-element characterization. Together these determine an n × m objects × attributes matrix, the rows of which are the characterizations of the prototypical objects. Over then species in Ω, an associated relative frequency vector gives the distribution of objects (and of their characterizations). The matrix and vector associate the objects in Ω with points in a metric space (P, δ); and it is with respect to various sums of distances in this attribute space that one can differentially order objects and attributes.

The definition of the distance function δ is generalized across kinds of difference, types of characterization, scale-types of measurement, Minkowski index ≧ 1, and any form of distribution of objects over species. Explanatory and taxonomic applications in psychology and other fields are discussed, with focus on classification, identification, recognition, and search. The Braille code and the identification of its characters provide illustration.

Conditions for removing the indeterminancy due to rotation are given for both the oblique and orthogonal factor analysis models. The conditions indicate why published counterexamples to conditions discussed by Jöreskog are not identifiable.

Probabilistic models of same-different and identification judgments are compared (within each paradigm) with regard to their sensitivity to perceptual dependence or the degree to which the underlying psychological dimensions are correlated. Three same-different judgment models are compared. One is a step function or decision bound model and the other two are probabilistic variants of a similarity model proposed by Shepard. Three types of identification models are compared: decision bound models, a probabilistic multidimensional scaling model, and probabilistic models based on the Shepard-Luce choice rule. The decision bound models were found to be most sensitive to perceptual dependence, especially when there is considerable distributional overlap. The same-different model based on the city-block metric and an exponential decay similarity function, and the corresponding identification model were found to be particularly insensitive to perceptual dependence. These results suggest that if a Shepard-type similarity function accurately describes behavior, then under typical experimental conditions it should be difficult to see the effects of perceptual dependence. This result provides strong support for a perceptual independence assumption when using these models. These theoretical results may also play an important role in studying different decision rules employed at different stages of identification training.

This paper presents some results on identification in multitrait-multimethod (MTMM) confirmatory factor analysis (CFA) models. Some MTMM models are not identified when the (factorial-patterned) loadings matrix is of deficient column rank. For at least one other MTMM model, identification does exist despite such deficiency. It is also shown that for some MTMM CFA models, Howe's (1955) conditions sufficient for rotational uniqueness can fail, yet the model may well be identified and rotationally unique. Implications of these results for CFA models in general are discussed.

We provide a framework for motivating and diagnosing the functional form in the structural part of nonlinear or linear structural equation models when the measurement model is a correctly specified linear confirmatory factor model. A mathematical population-based analysis provides asymptotic identification results for conditional expectations of a coordinate of an endogenous latent variable given exogenous and possibly other endogenous latent variables, and theoretically well-founded estimates of this conditional expectation are suggested. Simulation studies show that these estimators behave well compared to presently available alternatives. Practically, we recommend the estimator using Bartlett factor scores as input to classical non-parametric regression methods.

It is shown that problems of rotational equivalence of restricted factor loading matrices in orthogonal factor analysis are equivalent to problems of identification in simultaneous equations systems with covariance restrictions. A necessary (under a regularity assumption) and sufficient condition for local uniqueness is given and a counterexample is provided to a theorem by J. Algina concerning necessary and sufficient conditions for global uniqueness.

Multitrait-Multimethod (MTMM) matrices are often analyzed by means of confirmatory factor analysis (CFA). However, fitting MTMM models often leads to improper solutions, or non-convergence. In an attempt to overcome these problems, various alternative CFA models have been proposed, but with none of these the problem of finding improper solutions was solved completely. In the present paper, an approach is proposed where improper solutions are ruled out altogether and convergence is guaranteed. The approach is based on constrained variants of components analysis (CA). Besides the fact that these methods do not give improper solutions, they have the advantage that they provide component scores which can later on be used to relate the components to external variables. The new methods are illustrated by means of simulated data, as well as empirical data sets.

Defining equivalent models as those that reproduce the same set of covariance matrices, necessary and sufficient conditions are stated for the local equivalence of two expanded identified models M1 and M2 when fitting the more restricted model M0. Assuming several regularity conditions, the rank deficiency of the Jacobian matrix, composed of derivatives of the covariance elements with respect to the union of the free parameters of M1 and M2 (which characterizes model M12), is a necessary and sufficient condition for the local equivalence of M1 and M2. This condition is satisfied, in practice, when the analysis dealing with the fitting of M0, predicts that the decreases in the chi-square goodness-of-fit statistic for the fitting of M1 or M2, or M12 are all equal for any set of sample data, except on differences due to rounding errors.

This research concerns a mediation model, where the mediator model is linear and the outcome model is also linear but with a treatment–mediator interaction term and a residual correlated with the residual of the mediator model. Assuming the treatment is randomly assigned, parameters in this mediation model are shown to be partially identifiable. Under the normality assumption on the residual of the mediator and the residual of the outcome, explicit full-information maximum likelihood estimates of model parameters are introduced given the correlation between the residual for the mediator and the residual for the outcome. A consistent variance matrix of these estimates is derived. Currently, the coefficients of this mediation model are estimated using the iterative feasible generalized least squares (IFGLS) method that is originally developed for seemingly unrelated regressions (SURs). We argue that this mediation model is not a system of SURs. While the IFGLS estimates are consistent, their variance matrix is not. Theoretical comparisons of the FIMLE variance matrix and the IFGLS variance matrix are conducted. Our results are demonstrated by simulation studies and an empirical study. The FIMLE method has been implemented in a freely available R package iMediate.

Recently, there has been a renewed interest in the four-parameter item response theory model as a way to capture guessing and slipping behaviors in responses. Research has shown, however, that the nested three-parameter model suffers from issues of unidentifiability (San Martín et al. in Psychometrika 80:450–467, 2015), which places concern on the identifiability of the four-parameter model. Borrowing from recent advances in the identification of cognitive diagnostic models, in particular, the DINA model (Gu and Xu in Stat Sin https://doi.org/10.5705/ss.202018.0420, 2019), a new model is proposed with restrictions inspired by this new literature to help with the identification issue. Specifically, we show conditions under which the four-parameter model is strictly and generically identified. These conditions inform the presentation of a new exploratory model, which we call the dyad four-parameter normal ogive (Dyad-4PNO) model. This model is developed by placing a hierarchical structure on the DINA model and imposing equality constraints on a priori unknown dyads of items. We present a Bayesian formulation of this model, and show that model parameters can be accurately recovered. Finally, we apply the model to a real dataset.

In this article, we present a general theorem and proof for the global identification of composed CFA models. They consist of identified submodels that are related only through covariances between their respective latent factors. Composed CFA models are frequently used in the analysis of multimethod data, longitudinal data, or multidimensional psychometric data. Firstly, our theorem enables researchers to reduce the problem of identifying the composed model to the problem of identifying the submodels and verifying the conditions given by our theorem. Secondly, we show that composed CFA models are globally identified if the primary models are reduced models such as the CT-C$(M-1)$\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$(M-1)$$\end{document} model or similar types of models. In contrast, composed CFA models that include non-reduced primary models can be globally underidentified for certain types of cross-model covariance assumptions. We discuss necessary and sufficient conditions for the global identification of arbitrary composed CFA models and provide a Python code to check the identification status for an illustrative example. The code we provide can be easily adapted to more complex models.

We generalize factor analysis models by allowing the concentration matrix of the residuals to have nonzero off-diagonal elements. The resulting model is named graphical factor analysis model. Allowing a structure of associations gives information about the correlation left unexplained by the unobserved variables, which can be used both in the confirmatory and exploratory context. We first present a sufficient condition for global identifiability of this class of models with a generic number of factors, thereby extending the results in Stanghellini (1997) and Vicard (2000). We then consider the issue of model comparison and show that fast local computations are possible for this purpose, if the conditional independence graphs on the residuals are restricted to be decomposable and a Bayesian approach is adopted. To achieve this aim, we propose a new reversible jump MCMC method to approximate the posterior probabilities of the considered models. We then study the evolution of political democracy in 75 developing countries based on eight measures of democracy in two different years.