Parsimonious Mixtures of Skewed Bilinear Factor Analyzers

• URL: http://arxiv.org/abs/2607.14297v1
• Date: Wed, 15 Jul 2026 18:59:58 GMT
• Title: Parsimonious Mixtures of Skewed Bilinear Factor Analyzers
• Abstract summary: Mixture models which cluster skewed random matrices can often suffer from over- parameterization in the absence of performing dimension reduction.<n>An AECM algorithm for parameter estimation is discussed in detail.<n>The method is considered in the case of the MNIST dataset and the Olivetti faces dataset.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Mixture models which cluster skewed random matrices can often suffer from over-parameterization in the absence of performing dimension reduction. Even with the use of bilinear factor analyzers, further parameter reduction can be achieved by constraining parameters over clusters. In this manuscript propose a parsimonious family of 256 models for mixtures of skewed matrix variate bilinear factor analyzers, specifically in the case of the skew t distribution. An AECM algorithm for parameter estimation is discussed in detail. Further, extensive simulations are performed, and the method is considered in the case of the MNIST dataset and the Olivetti faces dataset.

Related papers

• Non-Asymptotic Analysis of Data Augmentation for Precision Matrix Estimation [12.919305286055616]
  We focus on two classes of estimators: linear shrinkage estimators with a target proportional to the identity matrix, and estimators derived from data augmentation.<n>For both classes of estimators, we derive estimators and provide concentration bounds for their quadratic error.<n>On the technical side, our analysis relies on tools from random matrix theory.
  arXiv  Detail & Related papers  (2025-10-02T15:28:14Z)
• A Hybrid Mixture of $t$-Factor Analyzers for Clustering High-dimensional Data [0.07673339435080444]
  This paper develops a novel hybrid approach for estimating the mixture model of $t$-factor analyzers (MtFA)<n>The effectiveness of our approach is demonstrated through simulations showcasing its superior computational efficiency compared to the existing method.<n>Our method is applied to cluster the Gamma-ray bursts, reinforcing several claims in the literature that Gamma-ray bursts have heterogeneous subpopulations and providing characterizations of the estimated groups.
  arXiv  Detail & Related papers  (2025-04-29T18:59:58Z)
• Induced Covariance for Causal Discovery in Linear Sparse Structures [55.2480439325792]
  Causal models seek to unravel the cause-effect relationships among variables from observed data. This paper introduces a novel causal discovery algorithm designed for settings in which variables exhibit linearly sparse relationships.
  arXiv  Detail & Related papers  (2024-10-02T04:01:38Z)
• Large-scale gradient-based training of Mixtures of Factor Analyzers [67.21722742907981]
  This article contributes both a theoretical analysis as well as a new method for efficient high-dimensional training by gradient descent. We prove that MFA training and inference/sampling can be performed based on precision matrices, which does not require matrix inversions after training is completed. Besides the theoretical analysis and matrices, we apply MFA to typical image datasets such as SVHN and MNIST, and demonstrate the ability to perform sample generation and outlier detection.
  arXiv  Detail & Related papers  (2023-08-26T06:12:33Z)
• A Bayesian Framework on Asymmetric Mixture of Factor Analyser [0.0]
  This paper introduces an MFA model with a rich and flexible class of skew normal (unrestricted) generalized hyperbolic (called SUNGH) distributions. The SUNGH family provides considerable flexibility to model skewness in different directions as well as allowing for heavy tailed data. Considering factor analysis models, the SUNGH family also allows for skewness and heavy tails for both the error component and factor scores.
  arXiv  Detail & Related papers  (2022-11-01T20:19:52Z)
• Learning Graphical Factor Models with Riemannian Optimization [70.13748170371889]
  This paper proposes a flexible algorithmic framework for graph learning under low-rank structural constraints. The problem is expressed as penalized maximum likelihood estimation of an elliptical distribution. We leverage geometries of positive definite matrices and positive semi-definite matrices of fixed rank that are well suited to elliptical models.
  arXiv  Detail & Related papers  (2022-10-21T13:19:45Z)
• Understanding Implicit Regularization in Over-Parameterized Single Index Model [55.41685740015095]
  We design regularization-free algorithms for the high-dimensional single index model. We provide theoretical guarantees for the induced implicit regularization phenomenon.
  arXiv  Detail & Related papers  (2020-07-16T13:27:47Z)
• Asymptotic Analysis of an Ensemble of Randomly Projected Linear Discriminants [94.46276668068327]
  In [1], an ensemble of randomly projected linear discriminants is used to classify datasets. We develop a consistent estimator of the misclassification probability as an alternative to the computationally-costly cross-validation estimator. We also demonstrate the use of our estimator for tuning the projection dimension on both real and synthetic data.
  arXiv  Detail & Related papers  (2020-04-17T12:47:04Z)
• Repulsive Mixture Models of Exponential Family PCA for Clustering [127.90219303669006]
  The mixture extension of exponential family principal component analysis ( EPCA) was designed to encode much more structural information about data distribution than the traditional EPCA. The traditional mixture of local EPCAs has the problem of model redundancy, i.e., overlaps among mixing components, which may cause ambiguity for data clustering. In this paper, a repulsiveness-encouraging prior is introduced among mixing components and a diversified EPCA mixture (DEPCAM) model is developed in the Bayesian framework.
  arXiv  Detail & Related papers  (2020-04-07T04:07:29Z)
• Nonconvex Matrix Completion with Linearly Parameterized Factors [10.163102766021373]
  Parametric Factorization holds for important examples including subspace and completion simulations. The effectiveness of our unified nonconstrained matrix optimization method is also illustrated.
  arXiv  Detail & Related papers  (2020-03-29T22:40:47Z)
• Flexible Clustering with a Sparse Mixture of Generalized Hyperbolic Distributions [6.839746711757701]
  Traditional approaches to model-based clustering often fail for high dimensional data. A parametrization of the component scale matrices for the mixture of generalized hyperbolic distributions is proposed. An analytically feasible expectation-maximization algorithm is developed.
  arXiv  Detail & Related papers  (2019-03-12T17:02:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.