On the Identifiability of Tensor Ranks via Prior Predictive Matching

• URL: http://arxiv.org/abs/2510.14523v1
• Date: Thu, 16 Oct 2025 10:13:45 GMT
• Title: On the Identifiability of Tensor Ranks via Prior Predictive Matching
• Authors: Eliezer da Silva, Arto Klami, Diego Mesquita, Iñigo Urteaga,
• Abstract summary: This paper introduces a rigorous approach to determine rank identifiability in probabilistic tensor models, based on prior predictive moment matching.<n>We establish an equivalence between rank identifiability and the solvability of such system.<n>We derive explicit closed-form rank estimators based on the moments of observed data only.
• Score: 12.745028028466047
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Selecting the latent dimensions (ranks) in tensor factorization is a central challenge that often relies on heuristic methods. This paper introduces a rigorous approach to determine rank identifiability in probabilistic tensor models, based on prior predictive moment matching. We transform a set of moment matching conditions into a log-linear system of equations in terms of marginal moments, prior hyperparameters, and ranks; establishing an equivalence between rank identifiability and the solvability of such system. We apply this framework to four foundational tensor-models, demonstrating that the linear structure of the PARAFAC/CP model, the chain structure of the Tensor Train model, and the closed-loop structure of the Tensor Ring model yield solvable systems, making their ranks identifiable. In contrast, we prove that the symmetric topology of the Tucker model leads to an underdetermined system, rendering the ranks unidentifiable by this method. For the identifiable models, we derive explicit closed-form rank estimators based on the moments of observed data only. We empirically validate these estimators and evaluate the robustness of the proposal.

Related papers

• Topology Identification and Inference over Graphs [61.06365536861156]
  Topology identification and inference of processes evolving over graphs arise in timely applications involving brain, transportation, financial, power, as well as social and information networks.<n>This chapter provides an overview of graph topology identification and statistical inference methods for multidimensional data.
  arXiv  Detail & Related papers  (2025-12-11T00:47:09Z)
• Score-Based Model for Low-Rank Tensor Recovery [49.158601255093416]
  Low-rank tensor decompositions (TDs) provide an effective framework for multiway data analysis.<n>Traditional TD methods rely on predefined structural assumptions, such as CP or Tucker decompositions.<n>We propose a score-based model that eliminates the need for predefined structural or distributional assumptions.
  arXiv  Detail & Related papers  (2025-06-27T15:05:37Z)
• A Sparse Bayesian Learning Algorithm for Estimation of Interaction Kernels in Motsch-Tadmor Model [0.9821874476902972]
  We investigate the data-driven identification of asymmetric interaction kernels in the Motsch-Tadmor model.<n>We propose a variational framework that reformulates kernel identification using the implicit form of the governing equations.<n>We develop a sparse Bayesian learning algorithm that incorporates informative priors for regularization, quantifies uncertainty, and enables principled model selection.
  arXiv  Detail & Related papers  (2025-05-11T17:43:32Z)
• BINDy -- Bayesian identification of nonlinear dynamics with reversible-jump Markov-chain Monte-Carlo [0.0]
  Model parsimony is an important emphcognitive bias in data-driven modelling that aids interpretability and helps to prevent over-fitting.<n>Sparse identification of nonlinear dynamics (SINDy) methods are able to learn sparse representations of complex dynamics directly from data.<n>A novel Bayesian treatment of dictionary learning system identification, as an alternative to SINDy, is envisaged.
  arXiv  Detail & Related papers  (2024-08-15T10:03:30Z)
• Online Identification of Stochastic Continuous-Time Wiener Models Using Sampled Data [4.037738063437126]
  We develop an online estimation algorithm based on an output-error predictor for the identification of continuous-time Wiener models. The method is robust with respect to the assumptions on the spectrum of the disturbance process.
  arXiv  Detail & Related papers  (2024-03-09T12:33:09Z)
• Stable Attractors for Neural networks classification via Ordinary Differential Equations (SA-nODE) [0.9786690381850358]
  A priori is constructed to accommodate a set of pre-assigned stationary stable attractors. The inherent ability to perform classification is reflected in the shaped basin of attractions associated to each of the target stable attractors. Although this method does not reach the performance of state-of-the-art deep learning algorithms, it illustrates that continuous dynamical systems with closed analytical interaction terms can serve as high-performance classifiers.
  arXiv  Detail & Related papers  (2023-11-17T08:30:41Z)
• Kalman Filter for Online Classification of Non-Stationary Data [101.26838049872651]
  In Online Continual Learning (OCL) a learning system receives a stream of data and sequentially performs prediction and training steps. We introduce a probabilistic Bayesian online learning model by using a neural representation and a state space model over the linear predictor weights. In experiments in multi-class classification we demonstrate the predictive ability of the model and its flexibility to capture non-stationarity.
  arXiv  Detail & Related papers  (2023-06-14T11:41:42Z)
• ChiroDiff: Modelling chirographic data with Diffusion Models [132.5223191478268]
  We introduce a powerful model-class namely "Denoising Diffusion Probabilistic Models" or DDPMs for chirographic data. Our model named "ChiroDiff", being non-autoregressive, learns to capture holistic concepts and therefore remains resilient to higher temporal sampling rate.
  arXiv  Detail & Related papers  (2023-04-07T15:17:48Z)
• Score-based Continuous-time Discrete Diffusion Models [102.65769839899315]
  We extend diffusion models to discrete variables by introducing a Markov jump process where the reverse process denoises via a continuous-time Markov chain. We show that an unbiased estimator can be obtained via simple matching the conditional marginal distributions. We demonstrate the effectiveness of the proposed method on a set of synthetic and real-world music and image benchmarks.
  arXiv  Detail & Related papers  (2022-11-30T05:33:29Z)
• A Bayesian Approach to Block-Term Tensor Decomposition Model Selection and Computation [10.91885508254207]
  The so-called block-term decomposition (BTD) tensor model, especially in its rank-$(L_r,L_r,1)$ version, has been recently receiving increasing attention. The challenge of estimating the BTD model structure, namely the number of block terms and their individual ranks, has only recently started to attract significant attention. A Bayesian approach is taken to addressing the problem of rank-$(L_r,L_r,1)$ BTD model selection and computation, based on the idea of imposing column sparsity emphjointly on the
  arXiv  Detail & Related papers  (2021-01-08T09:37:21Z)
• Identification of Probability weighted ARX models with arbitrary domains [75.91002178647165]
  PieceWise Affine models guarantees universal approximation, local linearity and equivalence to other classes of hybrid system. In this work, we focus on the identification of PieceWise Auto Regressive with eXogenous input models with arbitrary regions (NPWARX) The architecture is conceived following the Mixture of Expert concept, developed within the machine learning field.
  arXiv  Detail & Related papers  (2020-09-29T12:50:33Z)
• Structural Causal Models Are (Solvable by) Credal Networks [70.45873402967297]
  Causal inferences can be obtained by standard algorithms for the updating of credal nets. This contribution should be regarded as a systematic approach to represent structural causal models by credal networks. Experiments show that approximate algorithms for credal networks can immediately be used to do causal inference in real-size problems.
  arXiv  Detail & Related papers  (2020-08-02T11:19:36Z)

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.