Coupled tensor models for probability mass function estimation: Part II, uniqueness of the model

In this paper, uniqueness properties of a coupled factorization of 3D marginal tensors (or PCTF3D) are studied. The PCTF3D method (detailed in the Part I article) performs estimation of probability mass functions (PMFs) by coupling 3D marginals, seen as order-3 tensors. The core novelty of PCTF3D’s approach relies on the partial coupling which consists in choosing a limited set of 3D marginals to be coupled. PCTF3D uniqueness is examined through the prism of polynomial mappings and their recoverability. A numerical algorithm is proposed for finding the maximal rank for which recoverability is guaranteed. This approach properly accounts for the coupling strategy and simplex constraints. Using the proposed algorithm, the different coupling strategies from Part I are examined with respect to their uniqueness properties. Finally, a new identifiability bound is given for a so-called Cartesian coupling which improves existing sufficient bounds available in the literature.

Authors

Institutions

Publication Details

Journal
Signal Processing
Published
2025-12-20
DOI
https://doi.org/10.1016/j.sigpro.2025.110453
Primary Topic
Tensor decomposition and applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Coupled tensor models for probability mass function estimation: Part II, uniqueness of the model

Philippe Flores, David Brie, Konstantin Usevich
Signal Processing
Tensor decomposition and applications
article

Coupled tensor models for probability mass function estimation: Part II, uniqueness of the model

Philippe Flores, David Brie, Konstantin Usevich
article en

Abstract

In this paper, uniqueness properties of a coupled factorization of 3D marginal tensors (or PCTF3D) are studied. The PCTF3D method (detailed in the Part I article) performs estimation of probability mass functions (PMFs) by coupling 3D marginals, seen as order-3 tensors. The core novelty of PCTF3D’s approach relies on the partial coupling which consists in choosing a limited set of 3D marginals to be coupled. PCTF3D uniqueness is examined through the prism of polynomial mappings and their recoverability. A numerical algorithm is proposed for finding the maximal rank for which recoverability is guaranteed. This approach properly accounts for the coupling strategy and simplex constraints. Using the proposed algorithm, the different coupling strategies from Part I are examined with respect to their uniqueness properties. Finally, a new identifiability bound is given for a so-called Cartesian coupling which improves existing sufficient bounds available in the literature.

Signal ProcessingVol. 243
Institut polytechnique de Grenoble (FR), Centre National de la Recherche Scientifique (FR), Centre de Recherche en Automatique de Nancy (FR), Université Grenoble Alpes (FR), Université de Lorraine (FR)
Openalex Percentile: Top 60%
Tensor decomposition and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Coupled tensor models for probability mass function estimation: Part II, uniqueness of the model — Philippe Flores, David Brie, et al. · Signal Processing (2025) | TGRS Research Map | TGRS