Pith. sign in

REVIEW 2 cited by

High-Dimensional Tensor Classification with CP Low-Rank Discriminant Structure

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2409.14397 v1 pith:UJL3LNCD submitted 2024-09-22 stat.ME

classification stat.ME
keywords tensorclassificationdiscriminantapplicationslow-rankrc-pcatextscacross
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Tensor classification has become increasingly crucial in statistics and machine learning, with applications spanning neuroimaging, computer vision, and recommendation systems. However, the high dimensionality of tensors presents significant challenges in both theory and practice. To address these challenges, we introduce a novel data-driven classification framework based on linear discriminant analysis (LDA) that exploits the CP low-rank structure in the discriminant tensor. Our approach includes an advanced iterative projection algorithm for tensor LDA and incorporates a novel initialization scheme called Randomized Composite PCA (\textsc{rc-PCA}). \textsc{rc-PCA}, potentially of independent interest beyond tensor classification, relaxes the incoherence and eigen-ratio assumptions of existing algorithms and provides a warm start close to the global optimum. We establish global convergence guarantees for the tensor estimation algorithm using \textsc{rc-PCA} and develop new perturbation analyses for noise with cross-correlation, extending beyond the traditional i.i.d. assumption. This theoretical advancement has potential applications across various fields dealing with correlated data and allows us to derive statistical upper bounds on tensor estimation errors. Additionally, we confirm the rate-optimality of our classifier by establishing minimax optimal misclassification rates across a wide class of parameter spaces. Extensive simulations and real-world applications validate our method's superior performance. Keywords: Tensor classification; Linear discriminant analysis; Tensor iterative projection; CP low-rank; High-dimensional data; Minimax optimality.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Bridging Domain Adaptation and Graph Neural Networks: A Tensor-Based Framework for Effective Label Propagation

    cs.LG 2025-02 conditional novelty 6.0 of 10

    A tensor-based GNN with pseudo-label-conditioned label propagation achieves state-of-the-art average accuracy on domain adaptive graph classification benchmarks.

  2. Tensor Elliptical Graphic Model

    stat.ME 2025-08 conditional novelty 5.0 of 10

    A spatial-sign based one-step estimator for tensor elliptical graphical models achieves the same error rate as Gaussian tensor graphical model estimators under a wider elliptical family.

Pith tools