Tensor-on-tensor regression: Riemannian optimization, over-parameterization, statistical-computational gap and their interplay (Q7035873)

From MaRDI portal

Jump to:navigation, search

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Tensor-on-tensor regression: Riemannian optimization, over-parameterization, statistical-computational gap and their interplay

scientific article; zbMATH DE number 7976236

Language	Label	Description	Also known as
default for all languages	No label defined
English	Tensor-on-tensor regression: Riemannian optimization, over-parameterization, statistical-computational gap and their interplay	scientific article; zbMATH DE number 7976236

Statements

scholarly article

0 references

Tensor-on-tensor regression: Riemannian optimization, over-parameterization, statistical-computational gap and their interplay (English)

0 references

0 references

0 references

The Annals of Statistics

0 references

publication date

29 January 2025

0 references

full work available at URL

https://projecteuclid.org/journals/annals-of-statistics/volume-52/issue-6/Tensor-on-tensor-regression-Riemannian-optimization-over-parameterization-statistical/10.1214/24-AOS2396.full

0 references

zbMATH Keywords

low-degree polynomials

0 references

over-parameterization

0 references

Riemannian optimization

0 references

statistical-computational gaps

0 references

tensor-on-tensor regression

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

Tensor Regression Using Low-Rank and Sparse Tucker Decompositions

0 references

Tensor decompositions for learning latent variable models

0 references

0 references

A nearly tight sum-of-squares lower bound for the planted clique problem

0 references

Gradient descent with non-convex constraints: local concavity determines convergence

0 references

Benign overfitting in linear regression

0 references

Deep learning: a statistical viewpoint

0 references

Fit without fear: remarkable mathematical phenomena of deep learning through the prism of interpolation

0 references

Reconciling modern machine-learning practice and the classical bias-variance trade-off

0 references

Multilayer tensor factorization with applications to recommender systems

0 references

An Introduction to Optimization on Smooth Manifolds

0 references

A Riemannian trust region method for the canonical tensor rank approximation problem

0 references

The algorithmic phase transition of random \(k\)-SAT for low degree polynomials

0 references

Generalized Low-Rank Plus Sparse Tensor Estimation by Fast Riemannian Optimization

0 references

Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements

0 references

Non-convex projected gradient descent for generalized low-rank tensor regression

0 references

A Multilinear Singular Value Decomposition

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

The Average-Case Time Complexity of Certifying the Restricted Isometry Property

0 references

Subexponential-time algorithms for sparse PCA

0 references

New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition

0 references

Statistical query lower bounds for tensor PCA

0 references

A Newton-Grassmann method for computing the best multilinear rank-\((r_1,r_2,r_3)\) approximation of a tensor

0 references

Understanding Implicit Regularization in Over-Parameterized Single Index Model

0 references

Multiple Tensor-on-Tensor Regression: An Approach for Modeling Processes With Heterogeneous Sources of Data

0 references

Bayesian tensor regression

0 references

Exact Clustering in Tensor Block Model: Statistical Optimality and Computational Limit

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

A Riemannian trust-region method for low-rank tensor completion.

0 references

Most tensor problems are NP-hard

0 references

Multilinear tensor regression for longitudinal relational data

0 references

The power of sum-of-squares for detecting hidden structures

0 references

Efficient Bayesian estimation from few samples: community detection and related problems

0 references

Blind deconvolution by a steepest descent algorithm on a quotient manifold

0 references

Differential-geometric Newton method for the best rank-\((R _{1}, R _{2}, R _{3})\) approximation of tensors

0 references

Algorithmic Regularization in Model-Free Overparametrized Asymmetric Matrix Factorization

0 references

Matrix Completion From a Few Entries

0 references

Dynamical Tensor Approximation

0 references

Tensor Decompositions and Applications

0 references

Low-rank tensor completion by Riemannian optimization

0 references

Preconditioned low-rank Riemannian optimization for linear systems with tensor product structure

0 references

Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio

0 references

Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy

0 references

Tensor-on-Tensor Regression

0 references

Computationally efficient sparse clustering

0 references

Recursive Importance Sketching for Rank Constrained Least Squares: Algorithms and High-Order Convergence

0 references

Tensor clustering with planted structures: statistical optimality and computational limits

0 references

Tensor-on-tensor regression: Riemannian optimization, over-parameterization, statistical-computational gap and their interplay

0 references

Optimal estimation and computational limit of low-rank Gaussian mixtures

0 references

Fixed-rank matrix factorizations and Riemannian low-rank optimization

0 references

An Apocalypse-Free First-Order Low-Rank Optimization Algorithm with at Most One Rank Reduction Attempt per Iteration

0 references

Convex regularization for high-dimensional multiresponse tensor regression

0 references

Low rank tensor recovery via iterative hard thresholding

0 references

Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization

0 references

Quasi-Newton methods on Grassmannians and multilinear approximations of tensors

0 references

Convergence results for projected line-search methods on varieties of low-rank matrices via Łojasiewicz inequality

0 references

Theoretical Insights Into the Optimization Landscape of Over-Parameterized Shallow Neural Networks

0 references

Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-\((L_r,L_r,1)\) terms, and a new generalization

0 references

Riemannian optimization for high-dimensional tensor completion

0 references

STORE: sparse tensor response regression and neuroimaging analysis

0 references

The geometry of algorithms using hierarchical tensors

0 references

Low-rank matrix completion by Riemannian optimization

0 references

A new truncation strategy for the higher-order singular value decomposition

0 references

Guarantees of Riemannian optimization for low rank matrix recovery

0 references

On polynomial time methods for exact low-rank tensor completion

0 references

Inference for low-rank tensors -- no need to debias

0 references

Tensor SVD: Statistical and Computational Limits

0 references

Tensor Regression with Applications in Neuroimaging Data Analysis

0 references

Identifiers

10.1214/24-AOS2396

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Tensor-on-tensor regression: Riemannian optimization, over-parameterization, statistical-computational gap and their interplay

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