Mixed Membership Models for Multilevel Functional Data
Pith reviewed 2026-05-10 16:33 UTC · model grok-4.3
The pith
Mixed membership models for multilevel functional data become identifiable by translating the multivariate Karhunen-Loève decomposition into a hierarchical model with a repulsive prior.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
We show how the classical multivariate Karhunen-Loève decomposition can be translated into a simple hierarchical model for scalable and flexible expressivity of the underlying stochastic processes. The identifiability of partial membership structures is aided by the definition of a hierarchical repulsive prior on the unitary simplex.
What carries the argument
The hierarchical model obtained by recasting the multivariate Karhunen-Loève decomposition together with a hierarchical repulsive prior on the unitary simplex.
If this is right
- Each multilevel functional observation can be assigned a vector of partial memberships to multiple pure classes rather than a single hard cluster.
- The representation of the stochastic processes remains computationally tractable even for large collections of functional curves.
- The same model structure directly supports analysis of repeated functional measurements such as EEG time series.
- Partial membership estimates become stable enough for downstream scientific interpretation in neuroimaging studies.
Where Pith is reading between the lines
- The repulsive prior construction could be ported to mixed-membership models for non-functional data to improve identifiability in those settings as well.
- The hierarchical model may be compared against existing functional data clustering methods that rely on standard functional principal components to quantify gains in flexibility.
- Application to other multilevel domains, such as longitudinal imaging or spatial functional data, would test whether the same prior structure continues to deliver identifiability.
- Posterior inference algorithms developed for this model could be reused as modular components in larger Bayesian hierarchical models for functional data.
Load-bearing premise
The hierarchical repulsive prior on the unitary simplex is sufficient to guarantee identifiability of the partial membership vectors in the multilevel functional setting.
What would settle it
A simulation study in which data are generated from known partial membership vectors and the posterior recovers those vectors uniquely when the repulsive prior is used but shows label switching or non-identifiability when the prior is removed.
Figures
read the original abstract
Mixed membership models extend classical clustering by substituting the notion of uncertain membership with the notion of mixed membership. In particular, these models allow each observation to partially belong to multiple pure membership classes. We discuss mixed membership models for functional data by extending the framework to multilevel functional observations. We show how the classical multivariate Karhunen-Loeve decomposition can be translated into a simple hierarchical model for scalable and flexible expressivity of the underlying stochastic processes. The identifiability of partial membership structures is aided by the definition of a hierarchical repulsive prior on the unitary simplex. Our work is motivated and illustrated by applications to a study on functional brain imaging through electroencephalography (EEG) of children with autism spectrum disorder (ASD).
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript develops mixed membership models for multilevel functional data. It extends classical mixed membership frameworks to functional observations by reformulating the multivariate Karhunen-Loève decomposition as a hierarchical model for the underlying stochastic processes, enabling scalable and flexible expressivity. A hierarchical repulsive prior on the unitary simplex is introduced to aid identifiability of the partial membership vectors. The work is motivated by and illustrated with electroencephalography (EEG) data from children with autism spectrum disorder (ASD).
Significance. If the hierarchical model and repulsive prior are shown to deliver identifiable partial memberships in the multilevel functional setting, the contribution would be significant for functional data analysis involving nested structures, such as longitudinal or subject-within-group observations. The connection to the classical multivariate KL decomposition provides a natural link to existing FDA tools, and the EEG application demonstrates potential utility in neuroimaging where mixed rather than hard clustering is plausible. The repulsive prior idea, if rigorously validated, offers a targeted solution to a common identifiability challenge.
major comments (2)
- [§3.2] §3.2, the hierarchical repulsive prior construction: The manuscript defines the prior to promote identifiability of partial membership vectors but provides no formal theorem or derivation establishing that the repulsion effect propagates through the multilevel structure induced by the subject-level and within-subject processes in the multivariate KL decomposition. The central claim that this prior renders the membership vectors identifiable therefore rests on an unverified assumption about symmetry breaking across hierarchical layers.
- [§5] §5, simulation and EEG results: Recovery of membership vectors is reported, yet the experiments do not include a direct comparison against a non-repulsive (e.g., standard Dirichlet) prior under the same multilevel KL model. Without this ablation, it is impossible to isolate whether the hierarchical repulsive prior is necessary and sufficient for the claimed identifiability gains.
minor comments (2)
- [§2] §2: The notation distinguishing subject-level versus observation-level functional processes could be made more explicit (e.g., consistent use of subscripts for levels) to aid readers following the hierarchical model construction.
- The manuscript would benefit from additional references to prior mixed-membership work on functional or longitudinal data to better situate the novelty of the multilevel extension.
Simulated Author's Rebuttal
We thank the referee for their constructive and insightful comments, which have helped us identify areas where the manuscript can be strengthened. We address each major comment below and outline the revisions we will make.
read point-by-point responses
-
Referee: §3.2, the hierarchical repulsive prior construction: The manuscript defines the prior to promote identifiability of partial membership vectors but provides no formal theorem or derivation establishing that the repulsion effect propagates through the multilevel structure induced by the subject-level and within-subject processes in the multivariate KL decomposition. The central claim that this prior renders the membership vectors identifiable therefore rests on an unverified assumption about symmetry breaking across hierarchical layers.
Authors: We acknowledge that the manuscript relies on the hierarchical construction of the repulsive prior to break symmetry at the membership level, with the effect intended to propagate through the subject-level and within-subject KL components. While the current text motivates this via the model structure and provides supporting simulation evidence, we agree that an explicit derivation would strengthen the theoretical foundation. In the revised manuscript, we will add a proposition in §3.2 that formally shows how the repulsive component on the top-level membership vectors induces identifiability in the posterior, accounting for the integration over the hierarchical functional processes. This will clarify the symmetry-breaking mechanism without altering the model itself. revision: yes
-
Referee: §5, simulation and EEG results: Recovery of membership vectors is reported, yet the experiments do not include a direct comparison against a non-repulsive (e.g., standard Dirichlet) prior under the same multilevel KL model. Without this ablation, it is impossible to isolate whether the hierarchical repulsive prior is necessary and sufficient for the claimed identifiability gains.
Authors: We agree that a direct ablation comparing the hierarchical repulsive prior against a standard Dirichlet prior under the identical multilevel KL model would better isolate its contribution to identifiability. In the revised version of §5, we will include additional simulation results obtained by replacing the repulsive prior with a standard Dirichlet prior while keeping all other model components fixed. We will report comparative metrics on membership vector recovery, posterior stability, and convergence behavior. For the EEG analysis, we will add a brief discussion of the identifiability challenges (e.g., label switching) observed in preliminary fits with the non-repulsive prior, which motivated our choice. These additions will provide clearer evidence for the prior's role. revision: yes
Circularity Check
No circularity: claims introduce new hierarchical model and prior without reducing to fitted inputs or self-citations
full rationale
The abstract describes translating the classical multivariate Karhunen-Loève decomposition into a hierarchical model and aiding identifiability via a new hierarchical repulsive prior on the unitary simplex. No equations, fitting procedures, or self-citations are presented that would allow any prediction or identifiability result to reduce by construction to the inputs. The derivation chain is therefore self-contained as an extension of existing functional data tools rather than a redefinition of its own assumptions.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption The multivariate Karhunen-Loeve decomposition can be recast as a hierarchical model that preserves the covariance structure of multilevel functional observations.
- ad hoc to paper A hierarchical repulsive prior on the unitary simplex renders the partial membership vectors identifiable.
Reference graph
Works this paper leans on
-
[1]
S.: Peak alpha frequency is a neural marker of cognitive function across the autism spectrum
Dickinson, A., DiStefano, C., Senturk, D., Jeste, S. S.: Peak alpha frequency is a neural marker of cognitive function across the autism spectrum. European Journal of Neuroscience, Vol. 47(6), pp. 643-651 (2018)
work page 2018
-
[2]
Annals of Applied Statistics 14, 2053–2068 (2020)
Li, Q., Shamshoian, J., S¸ent¨urk, D., Sugar, C., Jeste, S., DiStefano, C., Telesca, D., et al.: Region-referenced spectral power dynamics of EEG signals: A hierarchical modeling approach. Annals of Applied Statistics 14, 2053–2068 (2020)
work page 2053
-
[3]
Happ, C. and Greven, S: Multivariate functional principal component analysis for data observed on different (dimensional) domains. Journal of the American Statis- tical Association 113, 649–659 (2018)
work page 2018
-
[4]
Journal of Computational and Graphical Statistics, 33(4), 1139-1149
Marco, N., S ¸ent¨ urk, D., Jeste, S., DiStefano, C., Dickinson, A., and Telesca, D.: Functional Mixed Membership Models. Journal of Computational and Graphical Statistics, 33(4), 1139-1149. (2024)
work page 2024
-
[5]
Erosheva, E., Fienberg, S., and Lafferty, J.: Mixed Membership Models of Scientific Publications, PNAS. 101, 5220–5227 (2004)
work page 2004
-
[6]
B.: Sparse Bayesian Infinite Factor Models
Bhattacharya, A., and Dunson, D. B.: Sparse Bayesian Infinite Factor Models. Biometrika, 98, 291–306 (2011)
work page 2011
-
[7]
Journal of the American Statistical Association, 118, 2860–2875 (2023)
Chen, Y., He, S., Yang, Y., and Liang, F: Learning Topic Models: Identifiability and Finite-Sample Analysis. Journal of the American Statistical Association, 118, 2860–2875 (2023)
work page 2023
-
[8]
Journal of Computa- tional and Graphical Statistics, 31, 422–435 (2022)
Beraha, M., Argiento, R., Møller, J., and Guglielmi, A.: MCMC Computations for Bayesian Mixture Models Using Repulsive Point Processes. Journal of Computa- tional and Graphical Statistics, 31, 422–435 (2022)
work page 2022
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.