Non-convex projected gradient descent for generalized low-rank tensor regression
From MaRDI portal
(Redirected from Publication:4633013)
Recommendations
- Nonconvex Low-Rank Tensor Completion from Noisy Data
- Gradient descent with non-convex constraints: local concavity determines convergence
- Convergence analysis of projected gradient descent for Schatten-p nonconvex matrix recovery
- An optimal statistical and computational framework for generalized tensor estimation
- High-dimensional regression with noisy and missing data: provable guarantees with nonconvexity
Cites work
- A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
- Convex Analysis
- Convex regularization for high-dimensional multiresponse tensor regression
- scientific article; zbMATH DE number 4061904 (Why is no real title available?)
- scientific article; zbMATH DE number 6438182 (Why is no real title available?)
- Local Rademacher complexities
- Regularized \(M\)-estimators with nonconvexity: statistical and algorithmic theory for local optima
- Regularized estimation in sparse high-dimensional time series models
- Statistics for high-dimensional data. Methods, theory and applications.
- Tensor Algebra and Multidimensional Harmonic Retrieval in Signal Processing for MIMO Radar
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Tensor Decompositions and Applications
- Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography
- The convex geometry of linear inverse problems
- Upper bounds on product and multiplier empirical processes
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(40)- An optimal statistical and computational framework for generalized tensor estimation
- Inference for low-rank tensors -- no need to debias
- Gradient-based optimization for regression in the functional tensor-train format
- Convex regularization for high-dimensional multiresponse tensor regression
- Non-convex optimization for machine learning
- ISLET: fast and optimal low-rank tensor regression via importance sketching
- Tensor Regression Using Low-Rank and Sparse Tucker Decompositions
- scientific article; zbMATH DE number 7506686 (Why is no real title available?)
- Nonconvex Low-Rank Tensor Completion from Noisy Data
- Low-rank, Orthogonally Decomposable Tensor Regression With Application to Visual Stimulus Decoding of fMRI Data
- Ultra-high dimensional single-index quantile regression
- A sharp blockwise tensor perturbation bound for orthogonal iteration
- Gradient descent with non-convex constraints: local concavity determines convergence
- Tensor completion with noisy side information
- Partially Observed Dynamic Tensor Response Regression
- Multivariate Temporal Point Process Regression
- Generalized Low-Rank Plus Sparse Tensor Estimation by Fast Riemannian Optimization
- Low-rank matrix estimation via nonconvex optimization methods in multi-response errors-in-variables regression
- Optimality conditions for Tucker low-rank tensor optimization
- An improved tensor regression model via location smoothing
- Low-rank tensor regression for selection of grouped variables
- Multiple Tensor-on-Tensor Regression: An Approach for Modeling Processes With Heterogeneous Sources of Data
- Randomized tensor decomposition and optimization in the Tucker and tensor train formats
- Tucker tensor factor models: matricization and mode-wise PCA estimation
- Projection pursuit Bayesian regression for symmetric matrix predictors
- A single-mode quasi Riemannian gradient descent algorithm for low-multilinear-rank tensor recovery
- Multi-Dimensional Domain Generalization with Low-Rank Structures
- Mean dimension reduction and testing for nonparametric tensor response regression
- Broadcasted nonparametric tensor regression
- The coefficient estimation of tensor autoregression based on TR decomposition
- A linearized alternating direction method of multipliers for solving complex semi-symmetric tensor equations and its applications
- High-dimensional regression with noisy and missing data: provable guarantees with nonconvexity
- An ADMM-based interior point method for solving nonnegative tensor least squares problems and its applications
- Low-rank matrix recovery via nonconvex optimization methods with application to errors-in-variables matrix regression
- The Tucker low-rank classification model for tensor data
- Tensor-on-tensor regression: Riemannian optimization, over-parameterization, statistical-computational gap and their interplay
- Conformalized Tensor Completion with Riemannian Optimization
- Online tensor learning: computational and statistical trade-offs, adaptivity and optimal regret
- Statistical inference in tensor completion: optimal uncertainty quantification and statistical-to-computational gaps
- Generalized high-dimensional tensor learning with nuclear norm regularization
This page was built for publication: Non-convex projected gradient descent for generalized low-rank tensor regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633013)
