Searcharxiv⌕ Search

arXiv · 2611.21863

When Is Membership Graded? Identifiability and Resolution Limits of a Graded Gaussian Mixture Model

Abstract

Mixed-membership models describe each unit as a graded blend of latent types. Before the blend is interpreted, the data should be able to rule out the simpler story in which every unit belongs to a single type. We ask when they can, in a scalar graded Gaussian mixture model, in which each observation is a Beta-weighted convex combination of independent Gaussian draws from two types, the mechanism behind functional mixed-membership models and the normal compositional model. The model is identifiable, unequal variances included, but the identifying information sits in the far tails of the marginal. For the symmetric model we give a closed-form hard-membership mixture that matches the graded marginal in five cumulants, and a Le Cam bound turns it into a certified sample size below which no test separates graded from hard membership with summed error under one half. The threshold is governed by the concentration $c$ relative to $c_0\approx d^2$, where $d$ is the type half-separation in within-type standard deviations. At $d=3$ it is about 2,600 observations at $c=3$ and 77,000 at $c=6$. Most of the difficulty comes from learning $c$. On 100 simulated datasets with graded membership, a correctly specified posterior under the default priors of a published Bayesian sampler for this model class reports hard membership every time, a weak prior gives intervals for the concentration spanning orders of magnitude, and the sampler's own answers depend on where it starts.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sie Hendrata Dharmawan, Peter Chin. 2026-11-16. When Is Membership Graded? Identifiability and Resolution Limits of a Graded Gaussian Mixture Model. https://searcharxiv.com/abs/2611.21863

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

On Minimal Observation Time for Recovering Latent Hawkes Networks

Dynamics of interacting systems in engineering, society, and nature often evolve over latent networks that govern which entities can interact. We study the problem of inferring these networks from event-based observations, which arise naturally in finance, seismology, and neuroscience. While there is substantial algorithmic work addressing this important problem, theoretical results are scarce. In this paper we ask the following fundamental question: what is the minimum time that one must observe the dynamics in order to exactly recover the underlying network, as a function of the number $d$ of interacting entities? For a class of stationary Hawkes processes with sparse, weak interactions, we prove that an observation time of order $\log d$ is sufficient and necessary. For the upper bound we construct a two-stage estimator that uses clipped and binned event data for screening, followed by a least-squares refinement, and apply concentration bounds derived from the Poisson cluster representation. For the lower bound we combine Fano's inequality with Jacod's Girsanov formula for point processes on a suitable subclass of networks.

math.ST↗

Bidirectional Random Projections

This paper analyzes bidirectional random projections for ordinary least squares (OLS) regression under the fixed design setting. Let $(X, Y) \in \mathbb{R}^{n\times p}\times\mathbb{R}^{n}$ be a sample and $W \in \mathbb{R}^{n_1\times n}$, $R \in \mathbb{R}^{p\times p_1}$ be two random projections. We develop an expected excess loss bound for the OLS estimator built on $(WXR, WY)$, extending an established bound for the OLS estimator built on $(XR, Y)$. Our analysis shows that our bound is larger and the gap between the two bounds decays at a rate of approximately $O(1/n_1)$. These findings are confirmed by numerical results.

math.ST↗

Asymptotics for Model Selection in Probabilistic Principal Component Analysis

The probabilistic formulation of principal component analysis promises statistically grounded solutions to the problem of selecting the number of principal components. However, developing tractable model selection methods is complicated by the fact that the probabilistic principal component analysis (PPCA) model exhibits non-standard large sample asymptotics at model singularities, where the Fisher information matrix does not have full rank. In this work, tools from singular learning theory are used to provide a complete description of the marginal likelihood asymptotics for PPCA. The singular Bayesian information criterion (sBIC) along with our asymptotic results provides an effective procedure for selecting the number of principal components. In particular, the sBIC corrects for the overpenalization of the standard dimension-based BIC, which leads to too few principal components being selected, while also selecting the smallest true model with probability converging to one. Our framework extends beyond PPCA, where we also provide expressions for the sBIC that can be used to select between PPCA and factor analysis models. In both simulations and on real data the effectiveness of the proposed sBIC methodology is demonstrated.

math.ST↗