Practical approximation algorithms for _1-regularized sparse rank-1 approximation to higher-order tensors

DOI10.1007/S11590-023-02032-6arXiv2207.07383OpenAlexW4382404638MaRDI QIDQ6124341FDOQ6124341

Authors: Xianpeng Mao, Yuning Yang 

Publication date: 27 March 2024

Published in: Optimization Letters (Search for Journal in Brave)

Abstract: Two approximation algorithms are proposed for $el{l}_1$-regularized sparse rank-1 approximation to higher-order tensors. The algorithms are based on multilinear relaxation and sparsification, which are easily implemented and well scalable. In particular, the second one scales linearly with the size of the input tensor. Based on a careful estimation of the $el{l}_1$-regularized sparsification, theoretical approximation lower bounds are derived. Our theoretical results also suggest an explicit way of choosing the regularization parameters. Numerical examples are provided to verify the proposed algorithms.

Full work available at URL: https://arxiv.org/abs/2207.07383

Recommendations

• Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors
• A sparse rank-1 approximation algorithm for high-order tensors
• Best sparse rank-1 approximation to higher-order tensors via a truncated exponential induced regularizer
• Low-rank approximation of tensors via sparse optimization.
• On approximation algorithm for orthogonal low-rank tensor approximation

zbMATH Keywords

tensorapproximation algorithmsparseapproximation bound\(\ell_1\) regularizationrank-1 approximation

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis
• Approximation bounds for sparse principal component analysis
• A Direct Formulation for Sparse PCA Using Semidefinite Programming
• Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• Provable Sparse Tensor Decomposition
• The cubic spherical optimization problems
• Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint
• Probability bounds for polynomial functions in random variables
• Tensor eigenvalues and their applications
• A sparse rank-1 approximation algorithm for high-order tensors
• Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors
• STORE: sparse tensor response regression and neuroimaging analysis
• Title not available (Why is that?)

This page was built for publication: Practical approximation algorithms for \(\ell_1\)-regularized sparse rank-1 approximation to higher-order tensors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6124341)