Aleshin-Guendel 2020 - Latent Class Identifiability Theorem and LCMCR

Summary

Theorem 2: with distinct class profiles, is identifiable if and only if . For sources a two-class model is not identifiable, and the paper gives two models with the same observed-cell probabilities but missing-cell probabilities 0.316 vs 0.219. Manrique-Vallier’s suggested and the LCMCR default are non-identifiable unless .

Overview

Restrict to with distinct class sampling probabilities ( for ). Loosening this restriction can only make the conditions on stricter, so the conclusions stand for families that violate it.

Main Content

Theorem 2

is identifiable if and only if .

Proof sketch, if direction (). Take with (Theorem 1). Then for all

Let be classes of whose profile does not appear among ‘s, the converse, . After cancelling shared profiles the system becomes where the columns of are the monomial vectors for the distinct profiles. Appendix 1 shows has full column rank (induction on , using a generalised Vandermonde-type matrix with distinct entries in each coordinate), so . Three cases follow: (profiles match, , summing weights gives ); (unmatched classes have zero weight, again ); (all weights zero, contradiction). So and .

Only-if direction (). Construct explicit with , (modified from Tahmasebi et al. 2018). Take weights and profiles

for and all . Appendix 2 proves for all with , using the function : differentiating the series times at 0 and the closed form (zero for , and ) equates alternating sums of over even and odd , which are the moment vectors of and .

Parameter counting versus identification. is necessary but far weaker: e.g. allows by counting but only by Theorem 2.

Table 1 reproduced and verified ( , )

Model
0.50.50.24750.24750.74250.7425
0.85714290.14285710.4950.4950.990.99

Under both, , , , yet and (recomputed by the snippet below). With observed individuals, gives under versus under : identical data, 14% apart in total population. Posterior uncertainty about is “not washed out as more data are collected” (Linero 2017).

import itertools, numpy as np
def cell_probs(nu, lam):
    K = len(lam[0]); out = {}
    for h in itertools.product([0, 1], repeat=K):
        out[h] = sum(n*np.prod([l[k] if h[k] else 1-l[k] for k in range(K)]) for n, l in zip(nu, lam))
    return out
Q = cell_probs([.5, .5], [[.2475]*2, [.7425]*2]); R = cell_probs([.8571429, .1428571], [[.495]*2, [.99]*2])
for P in (Q, R):
    p0 = P[(0, 0)]; print(round(p0, 3), [round(P[h]/(1-p0), 3) for h in [(0,1), (1,0), (1,1)]])
# 0.316 [0.276, 0.276, 0.448]   and   0.219 [0.276, 0.276, 0.448]

Implications for LCMCR (Sec. 4.2)

  • Manrique-Vallier (2016) uses in theory and in practice, suggesting , which is always non-identifiable (since ). The R package LCMCR default is : identifiable only if sources.
  • Extensions (Manrique-Vallier et al. 2019; Kang, Gile and Price 2020) share the problem.
  • Published applications: El Salvador (Sadinle 2018), Sri Lanka, Palembang, Peru (Manrique-Vallier, Ball and Sulmont 2019), Colombia, Philippines (Ball et al. 2019, in strata with fewer than 10 sources), Kampala (Doshi et al. 2019, , ), South Sudan. The paper could find the number of classes used in only two, and both were non-identifiable; with fewer than 10 sources and the default setting none of the other families were identified.
  • Fienberg’s warning that MSE “relies on the untestable assumption that the model that describes the observed counts also applies to the unobserved ones” is worse here: with a non-identifiable family multiple models describe the observed counts.
  • “Moving forward… it is imperative that families of models used for multiple-systems estimation in such sensitive contexts are known to be identified.”

Practical reading

Non-identifiability in a Bayesian fit shows up as prior-dominated posteriors for : more data do not narrow the interval in the non-identified direction. This is why LCMCR results can be driven by the Dirichlet-process concentration prior and truncation (Silverman 2020 - Madigan-York and Dirichlet Process Benchmarks). Check by simulating from a multi-class truth and fitting with above and below .

Connections

See Also