Pith. sign in

REVIEW 2 major objections 4 minor 67 references

Generalized Grade-of-Membership Estimation for High-dimensional Locally Dependent Data

T0 review · 2 major / 4 minor · reviewed 2026-08-10 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Flattening polytomous responses into a fat binary matrix and applying SVD estimates generalized grade-of-membership parameters with entrywise consistency under block-dependent local dependence, at a fraction of MCMC cost.

desk verdict A serious spectral GoM paper with a real theorem and a load-bearing pure-subject assumption that the real-data section never verifies; worth reviewing carefully. read the letter →

arxiv 2412.19796 v1 pith:NRK5H6AT submitted 2024-12-27 stat.ME math.STstat.MLstat.TH

Ling Chen , Chengzhu Huang , Yuqi Gu This is my paper · ORCID
classification stat.MEmath.STstat.MLstat.TH MSC 62H2562F12
keywords gradeofmembershipmodelmixedlocaldependencespectralmethodsingularvaluedecompositiontwo-to-infinityperturbationpolytomouscategoricaldataentrywiseerrorbounds
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper claims that grade-of-membership models, in which each subject's latent position is a point on a simplex, can be estimated by a fast spectral procedure even when responses are locally dependent. The key move is to flatten the three-way array of subjects, items, and response categories into a fat binary matrix, so the mean matrix has rank $K$ and the noise is block-dependent rather than entrywise independent. The authors prove finite-sample entrywise error bounds for the estimated membership scores and item parameters under a new $\ell_{2,\infty}$ singular-subspace perturbation theory that allows arbitrary dependence within noise blocks and sub-exponential tails. If the bounds are right, high-dimensional polytomous surveys, genotype admixture data, and single-cell counts become estimable in seconds rather than hours, and the method provides the first uniform consistency guarantees for GoM estimation in this setting.

What carries the argument

The central machinery is the flattening map $R_{i,\sum_{m<l}C_m+c}=\mathbf{1}(\tilde R_{i,l}=c)$, which turns categorical responses into an $N\times J$ binary matrix whose expectation $R^*=\Pi^*\Theta^{*\top}$ has rank $K$. Lemma 1 shows that, under the pure-subject condition, the population SVD exposes the simplex geometry: $\Pi^*=U^* U^{*-1}_{S,:}$ and $\Theta^*=V^*\Lambda^* U^{*\top}_{S,:}$, where $S$ indexes one pure subject per extreme profile. Algorithm 1 recovers $S$ by successive projection on the rows of the empirical left singular vectors, then forms $\hat{\Pi}$ and $\hat{\Theta}$ from the SVD of $R$. The new two-to-infinity singular-subspace perturbation bounds for block-dependent noise control the error propagation from the empirical singular vectors to the parameter estimates.

What would settle it

Simulate data satisfying Assumptions 1 and 3 but draw every membership row from a Dirichlet distribution with all coordinates bounded away from zero, so no subject is pure while rank$(\Theta^*)=K$. If the $\ell_{2,\infty}$ error of $\hat{\Pi}$ fails to shrink as $N$ and $J$ grow, the pure-subject assumption is load-bearing; if it shrinks, the theorem's sufficient condition is not necessary.

Watch

Extended reading notes

Core claim

The central claim is Theorem 2: under the paper's Assumptions 1–3, the top-$K$ SVD of the flattened data matrix followed by successive projection to find one pure subject per extreme profile estimates the generalized-GoM parameters up to a permutation with $\|\hat{\Pi}-\Pi^*P\|_{2,\infty}=O(\kappa^2(\Pi^*)\sigma_1(\Pi^*)\xi_1)$ and $\|\hat{\Theta}-\Theta^*P\|_{\infty}=O(\kappa^2(\Pi^*)\xi_3)$, with probability at least $1-O((N\vee J)^{-10})$. The quantities $\xi_1$ and $\xi_3$ come from new $\ell_{2,\infty}$ perturbation bounds for singular subspaces under locally dependent, flexibly distributed noise, and they depend on the block size $M$, the noise variances $\sigma^2$ and $\tilde{\sigma}^2$, and the incoherence parameters. This covers the classical polytomous GoM model after flattening as well as Binomial admixture and Poisson count models, and it does not require the local-independence assumption on which Bayesian MCMC treatments rely.

Load-bearing premise

The load-bearing premise is Assumption 2: each of the $K$ extreme latent profiles must have at least one pure subject whose membership vector is exactly the one-hot vector $e_k$, and the item-parameter matrix must have full column rank $K$; if no such pure subject exists, the simplex vertices are absent from the observed singular subspace, successive projection cannot be guaranteed to select the correct rows, and the Theorem 2 bounds do not follow.

Editorial extensions

If this is right

  • For polytomous survey data, uniform entrywise consistency holds for membership scores and item parameters as $N$ and $J$ grow, with computation dominated by a single SVD.
  • For genotype data with linkage disequilibrium, the binomial generalized-GoM model is fit in about 9 seconds, producing admixture estimates comparable to a widely used MCMC program that ran for over 44 hours.
  • For single-cell RNA-seq counts, a Poisson generalized-GoM fit recovers known developmental-stage memberships and runs in about 0.5 seconds, where an earlier GoM analysis took 12 minutes.
  • The $\ell_{2,\infty}$ perturbation theorem applies to any low-rank-plus-block-dependent-noise matrix, so it carries over to other latent-variable models with dependent entries, such as networks and topic models.
  • The spectral estimates can initialize Bayesian MCMC chains, shortening burn-in while retaining the option of full posterior inference.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Because the pure-subject assumption is not verified in the real-data applications, a natural robustness check is to measure, in the estimated left singular subspace, how far the closest row is from a vertex and whether the error degrades gracefully as that distance grows.
  • The explicit dependence of the bounds on block size $M$ suggests a practical rule: group items into the smallest blocks compatible with the known dependence structure, since enlarging $M$ inflates the entrywise error bounds.
  • The framework's reliance only on the expectation decomposition $R^*=\Pi^*\Theta^{*\top}$ suggests it can be extended to other exponential-family memberships, such as negative-binomial or multinomial-logit data, by changing only the final truncation step.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 4 minor

Summary. The manuscript proposes a spectral method for estimating generalized grade-of-membership (GoM) models from high-dimensional categorical, binomial, and count data. The key modeling idea is to flatten a three-way categorical tensor into a fat binary matrix and write the data as a low-rank expectation matrix plus a noise matrix whose entries may be locally dependent within blocks. The paper develops a new two-to-infinity singular-subspace perturbation theory for such block-dependent noise, proves finite-sample entrywise error bounds for the estimated membership matrix and item-parameter matrix, and demonstrates the method on simulations, the ANES survey, HapMap3 genotypes, and single-cell RNA-seq data. The central theoretical claims are Theorem 1 (singular-subspace perturbation under local dependence) and Theorem 2 (uniform consistency of the estimator under Assumptions 1, 2, and 3), with proofs in the supplement. The paper also emphasizes large computational gains over MCMC-based alternatives.

Significance. If the results hold, the paper makes a substantial contribution to high-dimensional mixed-membership estimation. The two-to-infinity perturbation theory for locally dependent, flexibly distributed noise is a clear methodological advance over existing entrywise independent-noise analyses, and the entrywise parameter bounds appear to be the first uniform guarantees for GoM-type models in this setting. The theoretical bounds are derived from external concentration and SPA results, not fitted to data, so the theory is non-circular. The paper also ships reproducible R code and includes extensive simulations that verify the advertised consistency rates and computational advantages. The main weakness is scope: the theoretical guarantee is conditional on the pure-subject Assumption 2, and the real-data sections neither verify nor relax that condition, so the practical claim of uniformly consistent estimation for the showcased datasets is not supported as stated.

major comments (2)
  1. [Assumption 2; Section 5; Section 6; Lemma S.11] The real-data applications are presented as demonstrations of the method, but they lie outside the scope of Theorem 2 because Assumption 2 is neither verified nor relaxed. The simulations in Section 5 enforce the assumption by construction, setting the first K rows of Pi* to the identity matrix, whereas the real-data membership estimates shown in Figure 7 are spread through the simplex with no subjects at the vertices. Under the proof of Lemma S.11, if no pure subjects exist, SPA cannot be guaranteed to recover the rows U*_S corresponding to the vertices, and the bound O(kappa^2(Pi*) sigma_1(Pi*) xi_1) does not follow. I therefore ask the authors to either restrict the consistency claims to data satisfying Assumption 2 and present the ANES, HapMap3, and single-cell analyses as illustrative, or add a diagnostic based on the estimated bPi (e.g., checking whether near-vertex rows exist) and discuss how a violation of Assumption 2 affects the SPA step.
  2. [Section 5; Section 3] The simulation validation does not explore the behavior of the estimator when Assumption 2 fails. Because the rows of Pi* are generated from a continuous Dirichlet distribution in the general mechanism and then overwritten by K identity rows, the exact pure-subject condition is always satisfied by construction. Since the practical value of the method for real mixed-membership data depends on robustness to this condition, a small simulation with all rows drawn from the continuous Dirichlet distribution—or with only near-pure subjects—would clarify whether the failure is gradual or abrupt. If the generalized-GoM model without pure subjects is not expectation-identifiable, the paper should state this explicitly and explain that the real-data results are not covered by the theoretical guarantees.
minor comments (4)
  1. [Section 6.1; Section 6.3] The number of extreme profiles K is chosen by convention or external analysis (K=3 for ANES in Section 6.1, K=6 for single-cell in Section 6.3), while Theorem 2 treats K as known. A sentence clarifying that these choices are not part of the theoretical guarantee would help the reader.
  2. [Section 4.3; Assumption 4] Assumption 4 uses the quantities c1 and nu without defining them in the main text; they are only defined later in Lemmas S.13 and S.14 of the supplement. Please either define them in the main text or add an explicit pointer to the supplement before Assumption 4.
  3. [Throughout] There are several typographical errors, including 'dateset' and 'GW AS' in the introduction and 'generaized-GoM' in the discussion. Also, the notation bPi+ in Algorithm 1 for the positive-part operation is not defined in the main text; a brief definition would improve readability.
  4. [Theorem 2 proof; Supplement S.2] In the proof of Theorem 2, the expression for ||bTheta P^top - Theta*||_infty uses the equality with P U_{bS,:} Lambda V^top. Since the infinity norm is invariant under transposition, the equality can be justified, but the presentation would be clearer if the transpose were written explicitly at each step.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the main bounds follow from external SPA and concentration results, and the few self-citations are not load-bearing.

full rationale

The derivation chain is self-contained: Assumptions 1-3 feed Theorem 1, whose proof uses matrix Bernstein concentration (Tropp, Brailovskaya and van Handel), a leave-one-row/block argument, and the algebraic expansion in Proposition 2. Theorem 2 then combines Theorem 1 with Assumption 2 and the successive projection algorithm, citing external results by Gillis and Vavasis (2013) and Mao et al. (2021); the needed Lemmas S.10-S.12 are stated and proved in the supplement rather than imported wholesale. The only self-citations are Chen and Gu (2024), used for the binary-case identifiability notion and for tuning-parameter suggestions in a pruning step. Neither carries the argument: Lemma 1 derives Pi* = U* U*^{-1}_{S,:} algebraically from the pure-subject rows and the SVD, and the identifiability citation is not used in the perturbation or error-bound proofs; the pruning suggestion affects implementation only. No fitted parameter is renamed as a prediction: the rates are functions of population quantities such as kappa(Pi*), sigma_1(Pi*), incoherence parameters, and noise moments. The pure-subject assumption is explicit in Assumption 2 and not hidden; its possible failure in real-data applications is a scope limitation rather than a circular reduction. Accordingly, the paper does not reduce to its inputs or to a self-citation chain.

Assumptions & free parameters 2 free parameters · 4 assumptions · 0 invented entities

The central claim rests on the pure-subject identifiability condition, signal strength and incoherence conditions, and a high-probability boundedness approximation for flexible noise. These are stated as assumptions, not derived. No new physical or mathematical entities are postulated.

free parameters (2)
  • K (number of extreme latent profiles) = 3 for ANES and HapMap, 6 for single-cell; set by convention or external analysis
    Algorithm 1 requires K as input; no data-driven estimator with guaranteed error is provided (Section 7).
  • Pruning tuning parameters (r=10, q=0.4, e=0.2) = r=10, q=0.4, e=0.2
    Fixed denoising constants for the pruning step before SPA, inherited from Chen and Gu (2024); not optimized here.
assumptions (4)
  • domain assumption Assumption 2: every extreme latent profile has at least one pure subject and rank(Theta*) = K
    Used in Lemma 1 to express Pi* and Theta* from the SVD; needed for SPA to recover the simplex vertices. Simulations engineer it by setting first K rows of Pi to identity; real data do not verify it.
  • domain assumption Assumption 3: signal strength sigma_K(Pi*) sigma_K(Theta*) roughly >= kappa* sigma (M sqrt(N) + sqrt(J)) and incoherence conditions
    Ensures the low-rank signal dominates noise so the top-K SVD is well-defined and the perturbation bounds are small.
  • domain assumption Assumption 1(b): noise is bounded with high probability or is close to a bounded matrix E' with Pr(E_{i,j}=E'_{i,j}) >= 1 - O(d^{-22})
    Used to apply matrix concentration; verified for sub-exponential tails in Lemma S.7.
  • standard math Matrix concentration and perturbation theorems from prior literature (Wedin, Bernstein, Brailovskaya-van Handel, Gillis-Vavasis SPA)
    Used throughout the proofs of Theorems 1 and 2; treated as given.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Generalized Grade-of-Membership Estimation for High-dimensional Locally Dependent Data." pith.science (2026). https://pith.science/paper/NRK5H6AT

@misc{pith2026241219796,
  author       = {Pith},
  title        = {Pith review of: Generalized Grade-of-Membership Estimation for High-dimensional Locally Dependent Data},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/NRK5H6AT}},
  note         = {Machine review of arXiv:2412.19796}
}
read the original abstract

This work focuses on the mixed membership models for multivariate categorical data widely used for analyzing survey responses and population genetics data. These grade of membership (GoM) models offer rich modeling power but present significant estimation challenges for high-dimensional polytomous data. Popular existing approaches, such as Bayesian MCMC inference, are not scalable and lack theoretical guarantees in high-dimensional settings. To address this, we first observe that data from this model can be reformulated as a three-way (quasi-)tensor, with many subjects responding to many items with varying numbers of categories. We introduce a novel and simple approach that flattens the three-way quasi-tensor into a "fat" matrix, and then perform a singular value decomposition of it to estimate parameters by exploiting the singular subspace geometry. Our fast spectral method can accommodate a broad range of data distributions with arbitrarily locally dependent noise, which we formalize as the generalized-GoM models. We establish finite-sample entrywise error bounds for the generalized-GoM model parameters. This is supported by a new sharp two-to-infinity singular subspace perturbation theory for locally dependent and flexibly distributed noise, a contribution of independent interest. Simulations and applications to data in political surveys, population genetics, and single-cell sequencing demonstrate our method's superior performance.

Figures

Figures reproduced from arXiv: 2412.19796 by the authors.

Figure 1
Figure 1. Visualization of the flattening technique. Cubes on the left represent the three-way [PITH_FULL_IMAGE:figures/full_fig_p008_1.png] view at source ↗
Figure 2
Figure 2. Simulation study I, estimation error for the proposed method using the flattening [PITH_FULL_IMAGE:figures/full_fig_p020_2.png] view at source ↗
Figure 3
Figure 3. Simulation study II with block-wise dependent data. The left panel presents the [PITH_FULL_IMAGE:figures/full_fig_p022_3.png] view at source ↗
Figures from the paper (6 more)
Figure 4
Figure 4. Figure 4: Simulation study III, comparing the estimation error and computation time for [PITH_FULL_IMAGE:figures/full_fig_p023_4.png]
Figure 5
Figure 5. Figure 5: Heatmap of a selected subset of the estimated item response parameters with [PITH_FULL_IMAGE:figures/full_fig_p025_5.png]
Figure 6
Figure 6. Figure 6: Heatmap of the covariance matrix of the estimated noise matrix [PITH_FULL_IMAGE:figures/full_fig_p026_6.png]
Figure 7
Figure 7. Figure 7: Ternary plots of the estimated membership scores for the HapMap3 data (left) and [PITH_FULL_IMAGE:figures/full_fig_p027_7.png]
Figure 8
Figure 8. Figure 8: Membership results from STRUCTURE (upper) and the proposed method (lower) [PITH_FULL_IMAGE:figures/full_fig_p028_8.png]
Figure 9
Figure 9. Figure 9: Generalized-GoM estimated memberships for the single cell data with [PITH_FULL_IMAGE:figures/full_fig_p029_9.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

67 extracted references · 53 canonical work pages

  1. [1]

    Abbe, E., Fan, J., and Wang, K. (2022). An _p theory of PCA and spectral clustering. The Annals of Statistics , 50(4):2359--2385

    work page 2022

  2. [2]

    Agterberg, J., Lubberts, Z., and Priebe, C. E. (2022). Entrywise estimation of singular vectors of low-rank matrices with heteroskedasticity and dependence. IEEE Transactions on Information Theory , 68(7):4618--4650

    work page 2022

  3. [3]

    M., Blei, D

    Airoldi, E. M., Blei, D. M., Erosheva, E. A., and Fienberg, S. E. (2015). Handbook of mixed membership models and their applications . CRC press Boca Raton, FL

    work page 2015

  4. [4]

    E., and Vogelstein, J

    Arroyo, J., Athreya, A., Cape, J., Chen, G., Priebe, C. E., and Vogelstein, J. T. (2021). Inference for multiple heterogeneous networks with a common invariant subspace. Journal of Machine Learning Research , 22(142):1--49

    2021

  5. [5]

    and Dunson, D

    Bhattacharya, A. and Dunson, D. B. (2012). Simplex factor models for multivariate unordered categorical data. Journal of the American Statistical Association , 107(497):362--377

    work page 2012

  6. [6]

    M., Ng, A

    Blei, D. M., Ng, A. Y., and Jordan, M. I. (2003). Latent D irichlet allocation. Journal of Machine Learning Research , 3(Jan):993--1022

    work page 2003

  7. [7]

    and van Handel, R

    Brailovskaya, T. and van Handel, R. (2024). Universality and sharp matrix concentration inequalities. Geometric and Functional Analysis , pages 1--105

    work page 2024

  8. [8]

    V., and Chen, Y

    Cai, C., Li, G., Chi, Y., Poor, H. V., and Chen, Y. (2021). Subspace estimation from unbalanced and incomplete data matrices: _ 2, statistical guarantees. Annals of Statistics , 49(2):944--967

    work page 2021

Show all 67 references
  1. [9]

    Cape, J., Tang, M., and Priebe, C. E. (2019). The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics. The Annals of Statistics , 47(5):2405--2439

    2019

  2. [10]

    and Gu, Y

    Chen, L. and Gu, Y. (2024). A spectral method for identifiable grade of membership analysis with binary responses. Psychometrika , 89:626–657

    2024

  3. [11]

    and Thissen, D

    Chen, W.-H. and Thissen, D. (1997). Local dependence indexes for item pairs using item response theory. Journal of Educational and Behavioral Statistics , 22(3):265--289

    1997

  4. [12]

    Chen, Y., Chi, Y., Fan, J., and Ma, C. (2021). Spectral methods for data science: A statistical perspective. Foundations and Trends in Machine Learning , 14(5):566--806

    2021

  5. [13]

    Chen, Y., Li, X., Liu, J., and Ying, Z. (2018). Robust measurement via a fused latent and graphical item response theory model. Psychometrika , 83:538--562

    2018

  6. [14]

    Clinton, J., Jackman, S., and Rivers, D. (2004). The statistical analysis of roll call data. American Political Science Review , 98(2):355--370

    2004

  7. [15]

    Consortium, I. H. . et al. (2010). Integrating common and rare genetic variation in diverse human populations. Nature , 467(7311):52

    2010

  8. [16]

    Deng, Q., Ramsk \"o ld, D., Reinius, B., and Sandberg, R. (2014). Single-cell RNA -seq reveals dynamic, random monoallelic gene expression in mammalian cells. Science , 343(6167):193--196

    2014

  9. [17]

    K., Hsiao, C

    Dey, K. K., Hsiao, C. J., and Stephens, M. (2017). Visualizing the structure of RNA -seq expression data using grade of membership models. PLoS Genetics , 13(3):e1006599

    2017

  10. [18]

    Erosheva, E., Fienberg, S., and Lafferty, J. (2004). Mixed-membership models of scientific publications. Proceedings of the National Academy of Sciences , 101(suppl\_1):5220--5227

    2004

  11. [19]

    Erosheva, E. A. (2002). Grade of membership and latent structure models with application to disability survey data . PhD thesis, Carnegie Mellon University

    2002

  12. [20]

    A., Fienberg, S

    Erosheva, E. A., Fienberg, S. E., and Joutard, C. (2007). Describing disability through individual-level mixture models for multivariate binary data. Annals of Applied Statistics , 1(2):346

    2007

  13. [21]

    Falush, D., Stephens, M., and Pritchard, J. K. (2003). Inference of population structure using multilocus genotype data: linked loci and correlated allele frequencies. Genetics , 164(4):1567--1587

    2003

  14. [22]

    Fan, J., Fan, Y., Han, X., and Lv, J. (2022). Simple: Statistical inference on membership profiles in large networks. Journal of the Royal Statistical Society Series B: Statistical Methodology , 84(2):630--653

    2022

  15. [23]

    Fan, J., Wang, W., and Zhong, Y. (2018). An _ eigenvector perturbation bound and its application to robust covariance estimation. Journal of Machine Learning Research , 18

    2018

  16. [24]

    Gallagher, I., Jones, A., and Rubin-Delanchy, P. (2021). Spectral embedding for dynamic networks with stability guarantees. Advances in Neural Information Processing Systems , 34:10158--10170

    2021

  17. [25]

    and Seoighe, C

    Gaujoux, R. and Seoighe, C. (2010). A flexible R package for nonnegative matrix factorization. BMC bioinformatics , 11:1--9

    2010

  18. [26]

    and Vavasis, S

    Gillis, N. and Vavasis, S. A. (2013). Fast and robust recursive algorithmsfor separable nonnegative matrix factorization. IEEE Transactions on Pattern Analysis and Machine Intelligence , 36(4):698--714

    2013

  19. [27]

    Gross, J. H. and Manrique-Vallier, D. (2012). A mixed-membership approach to the assessment of political ideology from survey responses. Handbook of mixed membership models and their applications , pages 119--140

    2012

  20. [28]

    E., Xu, G., and Dunson, D

    Gu, Y., Erosheva, E. E., Xu, G., and Dunson, D. B. (2023). Dimension-grouped mixed membership models for multivariate categorical data. Journal of Machine Learning Research , 24(88):1--49

    2023

  21. [29]

    Han, X., Tong, X., and Fan, Y. (2023). Eigen selection in spectral clustering: a theory-guided practice. Journal of the American Statistical Association , 118(541):109--121

    2023

  22. [30]

    C., Allen, D

    Hayton, J. C., Allen, D. G., and Scarpello, V. (2004). Factor retention decisions in exploratory factor analysis: A tutorial on parallel analysis. Organizational Research Methods , 7(2):191--205

    2004

  23. [31]

    W., Scheet, P., Gibbs, J

    Jakobsson, M., Scholz, S. W., Scheet, P., Gibbs, J. R., VanLiere, J. M., Fung, H.-C., Szpiech, Z. A., Degnan, J. H., Wang, K., Guerreiro, R., et al. (2008). Genotype, haplotype and copy-number variation in worldwide human populations. Nature , 451(7181):998--1003

    2008

  24. [32]

    J., and Zhao, H

    Jiang, W., Chen, L., Girgenti, M. J., and Zhao, H. (2024). Tuning parameters for polygenic risk score methods using gwas summary statistics from training data. Nature Communications , 15(1):24

    2024

  25. [33]

    T., and Luo, S

    Jin, J., Ke, Z. T., and Luo, S. (2021). Improvements on score, especially for weak signals. Sankhya A , pages 1--36

    2021

  26. [34]

    T., and Luo, S

    Jin, J., Ke, Z. T., and Luo, S. (2024). Mixed membership estimation for social networks. Journal of Econometrics , 239(2):105369

    2024

  27. [35]

    T., Luo, S., and Wang, M

    Jin, J., Ke, Z. T., Luo, S., and Wang, M. (2023). Optimal estimation of the number of network communities. Journal of the American Statistical Association , 118(543):2101--2116

    2023

  28. [36]

    and Rubin-Delanchy, P

    Jones, A. and Rubin-Delanchy, P. (2020). The multilayer random dot product graph. arXiv preprint arXiv:2007.10455

    2020 arXiv

  29. [37]

    and Gu, Y

    Kang, K. and Gu, Y. (2024). A blockwise mixed membership model for multivariate longitudinal data: Discovering clinical heterogeneity and identifying parkinson's disease subtypes. arXiv preprint arXiv:2410.01235

    2024 arXiv

  30. [38]

    Ke, Z. T. and Jin, J. (2023). Special invited paper: The score normalization, especially for heterogeneous network and text data. Stat , 12(1):e545

    2023

  31. [39]

    Ke, Z. T. and Wang, M. (2024). Using SVD for topic modeling. Journal of the American Statistical Association , 119(545):434--449

    2024

  32. [40]

    Koltchinskii, V., Lounici, K., and Tsybakov, A. B. (2011). Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion. The Annals of Statistics , 39(5):2302

    2011

  33. [41]

    R., Zhou, H., Kember, R

    Kranzler, H. R., Zhou, H., Kember, R. L., Vickers Smith, R., Justice, A. C., Damrauer, S., Tsao, P. S., Klarin, D., Baras, A., Reid, J., et al. (2019). Genome-wide association study of alcohol consumption and use disorder in 274,424 individuals from multiple populations. Natur...

    2019

  34. [42]

    and Seung, H

    Lee, D. and Seung, H. S. (2000). Algorithms for non-negative matrix factorization. Advances in Neural Information Processing Systems , 13

    2000

  35. [43]

    Lee, D. D. and Seung, H. S. (1999). Learning the parts of objects by non-negative matrix factorization. Nature , 401(6755):788--791

    1999

  36. [44]

    Lei, L. (2019). Unified _ 2, eigenspace perturbation theory for symmetric random matrices. arXiv preprint arXiv:1909.04798

    2019 arXiv

  37. [45]

    Lyu, Z., Chen, L., and Gu, Y. (2024). Degree-heterogeneous latent class analysis for high-dimensional discrete data. arXiv preprint arXiv:2402.18745

    2024 arXiv

  38. [46]

    G., Woodbury, M

    Manton, K. G., Woodbury, M. A., and Tolley, H. D. (1994). Statistical Applications Using Fuzzy Sets . Wiley-Interscience, New York

    1994

  39. [47]

    Mao, X., Sarkar, P., and Chakrabarti, D. (2021). Estimating mixed memberships with sharp eigenvector deviations. Journal of the American Statistical Association , 116(536):1928--1940

    2021

  40. [48]

    Modell, A., Gallagher, I., Ceccherini, E., Whiteley, N., and Rubin-Delanchy, P. (2024). Intensity profile projection: A framework for continuous-time representation learning for dynamic networks. Advances in Neural Information Processing Systems , 36

    2024

  41. [49]

    K., Stephens, M., and Donnelly, P

    Pritchard, J. K., Stephens, M., and Donnelly, P. (2000). Inference of population structure using multilocus genotype data. Genetics , 155(2):945--959

    2000

  42. [50]

    E., Cargill, M., Bolk, S., Ireland, J., Sabeti, P

    Reich, D. E., Cargill, M., Bolk, S., Ireland, J., Sabeti, P. C., Richter, D. J., Lavery, T., Kouyoumjian, R., Farhadian, S. F., Ward, R., et al. (2001). Linkage disequilibrium in the human genome. Nature , 411(6834):199--204

    2001

  43. [51]

    and Robitzsch, M

    Robitzsch, A. and Robitzsch, M. A. (2017). Package ‘sirt’. Computer software]. https://www. maths. bris. ac. uk/R/web/packages/sirt/sirt. pdf

    2017

  44. [52]

    Rosenberg, N. A. (2004). Distruct: a program for the graphical display of population structure. Molecular ecology notes , 4(1):137--138

    2004

  45. [53]

    Taddy, M. (2012). On estimation and selection for topic models. In Artificial Intelligence and Statistics , pages 1184--1193. PMLR

    2012

  46. [54]

    Tibshirani, R., Walther, G., and Hastie, T. (2001). Estimating the number of clusters in a data set via the gap statistic. Journal of the Royal Statistical Society: Series B (Statistical Methodology) , 63(2):411--423

    2001

  47. [55]

    Tropp, J. A. (2012). User-friendly tail bounds for sums of random matrices. Foundations of computational mathematics , 12:389--434

    2012

  48. [56]

    Tropp, J. A. (2015). An introduction to matrix concentration inequalities

    2015

  49. [57]

    Q., Munung, N

    Uffelmann, E., Huang, Q. Q., Munung, N. S., De Vries, J., Okada, Y., Martin, A. R., Martin, H. C., Lappalainen, T., and Posthuma, D. (2021). Genome-wide association studies. Nature Reviews Methods Primers , 1(1):59

    2021

  50. [58]

    G., Brugge, H., De Vries, D

    Van Der Wijst, M. G., Brugge, H., De Vries, D. H., Deelen, P., Swertz, M. A., Study, L. C., Consortium, B., and Franke, L. (2018). Single-cell RNA sequencing identifies celltype-specific cis- eQTLs and co-expression QTLs . Nature Genetics , 50(4):493--497

    2018

  51. [59]

    Wainwright, M. J. (2019). High-dimensional statistics: A non-asymptotic viewpoint , volume 48. Cambridge university press

    2019

  52. [60]

    Wang, Y. S. and Erosheva, E. A. (2015). Fitting mixed membership models using mixedmem

    2015

  53. [61]

    A., Clive, J., and Garson Jr, A

    Woodbury, M. A., Clive, J., and Garson Jr, A. (1978). Mathematical typology: a grade of membership technique for obtaining disease definition. Computers and Biomedical Research , 11(3):277--298

    1978

  54. [62]

    Wu, R., Zhang, L., and Tony Cai, T. (2023). Sparse topic modeling: Computational efficiency, near-optimal algorithms, and statistical inference. Journal of the American Statistical Association , 118(543):1849--1861

    2023

  55. [63]

    Xia, D. (2021). Normal approximation and confidence region of singular subspaces. Electronic Journal of Statistics , 15(2):3798--3851

    2021

  56. [64]

    Yan, Y., Chen, Y., and Fan, J. (2021). Inference for heteroskedastic PCA with missing data. arXiv preprint arXiv:2107.12365

    2021 arXiv

  57. [65]

    Yan, Y., Chen, Y., and Fan, J. (2024). Inference for heteroskedastic PCA with missing data. The Annals of Statistics , 52(2):729--756

    2024

  58. [66]

    Zhang, Y., Levina, E., and Zhu, J. (2020). Detecting overlapping communities in networks using spectral methods. SIAM Journal on Mathematics of Data Science , 2(2):265--283

    2020

  59. [67]

    E., Mukherjee, S., and Dunson, D

    Zhao, S., Engelhardt, B. E., Mukherjee, S., and Dunson, D. B. (2018). Fast moment estimation for generalized latent D irichlet models. Journal of the American Statistical Association , 113(524):1528--1540

    2018

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.