On the computational benefit of tensor separation for high-dimensional discrete convolutions
From MaRDI portal
Publication:1937804
Recommendations
- Tensorisation of vectors and their efficient convolution
- Fast and accurate tensor approximation of a multivariate convolution with linear scaling in dimension
- Fast multidimensional convolution in low-rank tensor formats via cross approximation
- Learning a deep convolutional neural network via tensor decomposition
- Tensor Decomposition for Signal Processing and Machine Learning
- Exploiting Efficient Representations in Large-Scale Tensor Decompositions
- Recursive tensor-train decomposition in higher dimensions
- Numerical tensor techniques for multidimensional convolution products
- Approximate tensor decompositions: disappearance of many separations
- On the optimization landscape of tensor decompositions
Cites work
- scientific article; zbMATH DE number 1820149 (Why is no real title available?)
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Computer-aided design of separable two-dimensional digital filters
- Dimensionality reduction in higher-order signal processing and rank-\((R_1,R_2,\ldots,R_N)\) reduction in multilinear algebra
- Fast and accurate tensor approximation of a multivariate convolution with linear scaling in dimension
- Multidimensional filtering based on a tensor approach
- Multilinear algebra for analyzing data with multiple linkages
- Multivariate regression and machine learning with sums of separable functions
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Rank-one approximation to high order tensors
- Tensor Decompositions and Applications
This page was built for publication: On the computational benefit of tensor separation for high-dimensional discrete convolutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1937804)