Pith. sign in

REVIEW 2 cited by

Statistical Inference for Low-Rank Tensor Models

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 2501.16223 v1 pith:T5QDL2E5 submitted 2025-01-27 math.ST stat.MEstat.MLstat.TH

classification math.STstat.MEstat.MLstat.TH
keywords inferencelow-tucker-ranktensorfunctionalslinearstatisticaldataframework
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Statistical inference for tensors has emerged as a critical challenge in analyzing high-dimensional data in modern data science. This paper introduces a unified framework for inferring general and low-Tucker-rank linear functionals of low-Tucker-rank signal tensors for several low-rank tensor models. Our methodology tackles two primary goals: achieving asymptotic normality and constructing minimax-optimal confidence intervals. By leveraging a debiasing strategy and projecting onto the tangent space of the low-Tucker-rank manifold, we enable inference for general and structured linear functionals, extending far beyond the scope of traditional entrywise inference. Specifically, in the low-Tucker-rank tensor regression or PCA model, we establish the computational and statistical efficiency of our approach, achieving near-optimal sample size requirements (in regression model) and signal-to-noise ratio (SNR) conditions (in PCA model) for general linear functionals without requiring sparsity in the loading tensor. Our framework also attains both computationally and statistically optimal sample size and SNR thresholds for low-Tucker-rank linear functionals. Numerical experiments validate our theoretical results, showcasing the framework's utility in diverse applications. This work addresses significant methodological gaps in statistical inference, advancing tensor analysis for complex and high-dimensional data environments.

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. Generalized Tensor Completion with Non-Random Missingness

    stat.ME 2025-09 conditional novelty 7.0 of 10

    Generalized tensor completion that jointly fits a low-rank tensor and a logistic missing-not-at-random mechanism, with per-iteration error bounds and a MCAR-versus-MNAR test.

  2. 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.

Pith tools