Efficient randomized algorithms for fixed precision problem of approximate Tucker decomposition (Q7016677)

!

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

Efficient randomized algorithms for fixed precision problem of approximate Tucker decomposition

scientific article; zbMATH DE number 8005338

Language	Label	Description	Also known as
default for all languages	No label defined
English	Efficient randomized algorithms for fixed precision problem of approximate Tucker decomposition	scientific article; zbMATH DE number 8005338

Statements

instance of

scholarly article

0 references

title

Efficient randomized algorithms for fixed precision problem of approximate Tucker decomposition (English)

0 references

0 references

0 references

0 references

SIAM Journal on Matrix Analysis and Applications

0 references

publication date

6 March 2025

0 references

zbMATH Keywords

Tucker decomposition

0 references

fixed-precision problem

0 references

randomized algorithms

0 references

standard Gaussian matrices

0 references

continuous uniform distributions

0 references

Khatri-Rao product

0 references

adaptive T-HOSVD

0 references

adaptive ST-HOSVD

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Oblivious Sketching of High-Degree Polynomial Kernels

0 references

The fast Johnson-Lindenstrauss transform and approximate nearest neighbors

0 references

Algorithm 862

0 references

TuckerMPI: a parallel C++/MPI software package for large-scale data compression via the Tucker tensor decomposition

0 references

Johnson–Lindenstrauss Embeddings with Kronecker Structure

0 references

Improved matrix algorithms via the subsampled randomized Hadamard transform

0 references

Randomized algorithms for the approximations of Tucker and the tensor train decompositions

0 references

Theory and Computation of Complex Tensors and its Applications

0 references

The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection

0 references

An efficient randomized algorithm for computing the approximate Tucker decomposition

0 references

Randomized algorithms for the low multilinear rank approximations of tensors

0 references

Tensor-structured sketching for constrained least squares

0 references

Structured random sketching for PDE inverse problems

0 references

Tensor networks for dimensionality reduction and large-scale optimization. I: Low-rank tensor decompositions

0 references

Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 2 Applications and Future Perspectives

0 references

Low-rank approximation and regression in input sparsity time

0 references

A randomized algorithm for a tensor-based generalization of the singular value decomposition

0 references

Adaptive hierarchical subtensor partitioning for tensor compression

0 references

Q4917542

0 references

Wedderburn rank reduction and Krylov subspace method for tensor approximation. I: Tucker case

0 references

Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions

0 references

Best low multilinear rank approximation of higher-order tensors, based on the Riemannian trust-region scheme

0 references

Faster Johnson-Lindenstrauss transforms via Kronecker products

0 references

Parallel Candecomp/Parafac decomposition of sparse tensors using dimension trees

0 references

Tensor Decompositions and Applications

0 references

Recompression of Hadamard Products of Tensors in Tucker Format

0 references

Low-rank tensor completion by Riemannian optimization

0 references

Smallest singular value of random matrices and geometry of random polytopes

0 references

A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices

0 references

Parallel Randomized Tucker Decomposition Algorithms

0 references

Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format

0 references

Compressed matrix multiplication

0 references

Software for Sparse Tensor Decomposition on Emerging Computing Architectures

0 references

Low rank tensor recovery via iterative hard thresholding

0 references

Randomized alternating least squares for canonical tensor decompositions: application to a PDE with random data

0 references

Smallest singular value of a random rectangular matrix

0 references

HOID: higher order interpolatory decomposition for tensors based on Tucker representation

0 references

Handwritten digit classification using higher order singular value decomposition

0 references

Quasi-Newton methods on Grassmannians and multilinear approximations of tensors

0 references

Randomized LU decomposition

0 references

Low-rank Tucker approximation of a tensor from streaming data

0 references

Practical sketching algorithms for low-rank matrix approximation

0 references

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

0 references

The theory of probability. Explorations and applications

0 references

High-dimensional probability. An introduction with applications in data science

0 references

A fast randomized algorithm for the approximation of matrices

0 references

RA-HOOI: rank-adaptive higher-order orthogonal iteration for the fixed-accuracy low multilinear-rank approximation of tensors

0 references

Efficient randomized algorithms for the fixed-precision low-rank matrix approximation

0 references

Fast Nonnegative Matrix/Tensor Factorization Based on Low-Rank Approximation

0 references

Identifiers

zbMATH Open document ID

1556.65014

0 references

DOI

10.1137/23M1594066

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Efficient randomized algorithms for fixed precision problem of approximate Tucker decomposition