Inference for low-rank tensors -- no need to debias (Q2131273)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Inference for low-rank tensors -- no need to debias	scientific article

Statements

scholarly article

0 references

Inference for low-rank tensors -- no need to debias (English)

0 references

0 references

0 references

0 references

The Annals of Statistics

0 references

publication date

25 April 2022

0 references

full work available at URL

https://arxiv.org/abs/2012.14844

0 references

zbMATH Keywords

asymptotic distribution

0 references

confidence region

0 references

statistical inference

0 references

tensor principal component analysis

0 references

tensor regression

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

Tensor decompositions for learning latent variable models

0 references

High-Dimensional Covariance Decomposition into Sparse Markov and Independence Models

0 references

Singular vector and singular subspace distribution for the matrix denoising model

0 references

Eigenvectors of Orthogonally Decomposable Functions

0 references

The Landscape of the Spiked Tensor Model

0 references

Multilayer tensor factorization with applications to recommender systems

0 references

Geometric inference for general high-dimensional linear inverse problems

0 references

Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices

0 references

PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming

0 references

Uncertainty quantification for matrix compressed sensing and quantum tomography problems

0 references

0 references

On the Tensor SVD and the Optimal Low Rank Orthogonal Approximation of Tensors

0 references

Phase transition in the spiked random tensor with Rademacher prior

0 references

Inference and uncertainty quantification for noisy matrix completion

0 references

0 references

On the Best Rank-1 and Rank-(<i>R</i><sub>1</sub> ,<i>R</i><sub>2</sub> ,. . .,<i>R<sub>N</sub></i>) Approximation of Higher-Order Tensors

0 references

Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem

0 references

0 references

Generalized high-dimensional trace regression via nuclear norm regularization

0 references

Weighted Matrix Completion From Non-Random, Non-Uniform Sampling Patterns

0 references

An optimal statistical and computational framework for generalized tensor estimation

0 references

Sparse and Low-Rank Tensor Estimation via Cubic Sketchings

0 references

Most Tensor Problems Are NP-Hard

0 references

Confidence Intervals and Hypothesis Testing for High-Dimensional Regression

0 references

Community detection on mixture multilayer networks via regularized tensor decomposition

0 references

Orthogonal Tensor Decompositions

0 references

Tensor Decompositions and Applications

0 references

Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion

0 references

0 references

Rapid, robust, and reliable blind deconvolution via nonconvex optimization

0 references

Tensor clustering with planted structures: statistical optimality and computational limits

0 references

Tensor product analysis of partial difference equations

0 references

Spectral Algorithms for Tensor Completion

0 references

Statistical limits of spiked tensor models

0 references

Convex regularization for high-dimensional multiresponse tensor regression

0 references

Low rank tensor recovery via iterative hard thresholding

0 references

0 references

Dynamic Tensor Clustering

0 references

Provable Sparse Tensor Decomposition

0 references

A New Truncation Strategy for the Higher-Order Singular Value Decomposition

0 references

On asymptotically optimal confidence regions and tests for high-dimensional models

0 references

Confidence Region of Singular Subspaces for Low-Rank Matrix Regression

0 references

Normal approximation and confidence region of singular subspaces

0 references

On polynomial time methods for exact low-rank tensor completion

0 references

Statistical Inferences of Linear Forms for Noisy Matrix Completion

0 references

On tensor completion via nuclear norm minimization

0 references

Cross: efficient low-rank tensor completion

0 references

Optimal Sparse Singular Value Decomposition for High-Dimensional High-Order Data

0 references

Tensor SVD: Statistical and Computational Limits

0 references

ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching

0 references

The sparsity and bias of the LASSO selection in high-dimensional linear regression

0 references

Confidence Intervals for Low Dimensional Parameters in High Dimensional Linear Models

0 references

Rank-One Approximation to High Order Tensors

0 references

Tensor Regression with Applications in Neuroimaging Data Analysis

0 references

Identifiers

zbMATH Open document ID

0 references

10.1214/21-AOS2146

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2131273

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2131273&oldid=37017398"