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

scientific article; zbMATH DE number 7468918

Language	Label	Description	Also known as
English	ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching	scientific article; zbMATH DE number 7468918

Statements

instance of

scholarly article

0 references

title

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

0 references

0 references

0 references

0 references

0 references

SIAM Journal on Mathematics of Data Science

0 references

publication date

3 February 2022

0 references

full work available at URL

https://arxiv.org/abs/1911.03804

0 references

zbMATH Keywords

dimension reduction

0 references

high-order orthogonal iteration

0 references

minimax optimality

0 references

sketching

0 references

tensor regression

0 references

describes a project that uses

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

Tensor decompositions for learning latent variable models

0 references

A projection method to solve linear systems in tensor format

0 references

A PTAS for ℓp-Low Rank Approximation

0 references

Adaptive cross approximation of multivariate functions

0 references

Algorithms for Numerical Analysis in High Dimensions

0 references

Multilayer tensor factorization with applications to recommender systems

0 references

Linear systems with a canonical polyadic decomposition constrained solution: Algorithms and applications

0 references

Optimal CUR Matrix Decompositions

0 references

A Singular Value Thresholding Algorithm for Matrix Completion

0 references

Optimal rates of convergence for noisy sparse phase retrieval via thresholded Wirtinger flow

0 references

ROP: matrix recovery via rank-one projections

0 references

Generalizing the column-row matrix decomposition to multi-way arrays

0 references

Phase Retrieval via Wirtinger Flow: Theory and Algorithms

0 references

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

0 references

Decoding by Linear Programming

0 references

The Power of Convex Relaxation: Near-Optimal Matrix Completion

0 references

Finding frequent items in data streams

0 references

Q4633013

0 references

Exact and Stable Covariance Estimation From Quadratic Sampling via Convex Programming

0 references

Low-Rank Approximation and Regression in Input Sparsity Time

0 references

Sketching Sparse Matrices, Covariances, and Graphs via Tensor Products

0 references

On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors

0 references

Q5405231

0 references

A Newton–Grassmann Method for Computing the Best Multilinear Rank-$(r_1,$ $r_2,$ $r_3)$ Approximation of a Tensor

0 references

Variational calculus with sums of elementary tensors of fixed rank

0 references

Generalized high-dimensional trace regression via nuclear norm regularization

0 references

Sure Independence Screening for Ultrahigh Dimensional Feature Space

0 references

Greedy low-rank approximation in Tucker format of solutions of tensor linear systems

0 references

Wedderburn Rank Reduction and Krylov Subspace Method for Tensor Approximation. Part 1: Tucker Case

0 references

Hierarchical Singular Value Decomposition of Tensors

0 references

A literature survey of low-rank tensor approximation techniques

0 references

Q4636988

0 references

Tensor Learning for Regression

0 references

A new scheme for the tensor representation

0 references

Sparse and Low-Rank Tensor Estimation via Cubic Sketchings

0 references

Graphical model selection and estimation for high dimensional tensor data

0 references

Multilinear tensor regression for longitudinal relational data

0 references

A black-box low-rank approximation algorithm for fast matrix assembly in isogeometric analysis

0 references

Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement

0 references

Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme

0 references

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

0 references

Sparser Johnson-Lindenstrauss Transforms

0 references

Tensor Decompositions and Applications

0 references

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

0 references

Preconditioned Low-rank Riemannian Optimization for Linear Systems with Tensor Product Structure

0 references

Krylov Subspace Methods for Linear Systems with Tensor Product Structure

0 references

Applied Multiway Data Analysis

0 references

Oracle inequalities and optimal inference under group sparsity

0 references

Tensor product analysis of partial difference equations

0 references

Randomized Algorithms for Matrices and Data

0 references

Tensor-CUR Decompositions for Tensor-Based Data

0 references

Maximum likelihood estimation for the tensor normal distribution: Algorithm, minimum sample size, and empirical bias and dispersion

0 references

Optimal Algorithms for <formula formulatype="inline"> <tex Notation="TeX">$L_{1}$</tex></formula>-subspace Signal Processing

0 references

Efficient L1-Norm Principal-Component Analysis via Bit Flipping

0 references

Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression

0 references

Spectral Algorithms for Tensor Completion

0 references

Tensor-Train Decomposition

0 references

Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time

0 references

Cross approximation in tensor electron density computations

0 references

Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions

0 references

Compressed matrix multiplication

0 references

Covariate-Adjusted Tensor Classification in High-Dimensions

0 references

Randomized Sketches of Convex Programs With Sharp Guarantees

0 references

Iterative Hessian sketch: Fast and accurate solution approximation for constrained least-squares

0 references

Q2953637

0 references

Convex regularization for high-dimensional multiresponse tensor regression

0 references

Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

0 references

Krylov-type methods for tensor computations.I

0 references

Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors

0 references

Tensor Decomposition for Signal Processing and Machine Learning

0 references

Low rank approximation with entrywise l 1 -norm error

0 references

Relative Error Tensor Low Rank Approximation

0 references

Q4637064

0 references

Q3161693

0 references

Practical Sketching Algorithms for Low-Rank Matrix Approximation

0 references

Why Are Big Data Matrices Approximately Low Rank?

0 references

Sketching meets random projection in the dual: a provable recovery algorithm for big and high-dimensional data

0 references

Computational Advertising: Techniques for Targeting Relevant Ads

0 references

On polynomial time methods for exact low-rank tensor completion

0 references

Sure independence screening and compressed random sensing

0 references

A fast unified algorithm for solving group-lasso penalize learning problems

0 references

Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach

0 references

Model Selection and Estimation in Regression with Grouped Variables

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

Random Projections for Classification: A Recovery Approach

0 references

Tensor Regression with Applications in Neuroimaging Data Analysis

0 references

Gemini: graph estimation with matrix variate normal instances

0 references

Identifiers

zbMATH Open document ID

1484.65095

0 references

DOI

10.1137/19M126476X

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5027035