More Efficient Sampling for Tensor Decomposition With Worst-Case Guarantees

14 October 2021

Papers citing "More Efficient Sampling for Tensor Decomposition With Worst-Case Guarantees"

7 / 7 papers shown

Title
A Counterexample in Image Registration Serap A. Savari 26 2 0 14 Oct 2024
Alternating Local Enumeration (TnALE): Solving Tensor Network Structure Search with Fewer Evaluations C. Li Junhua Zeng Chunmei Li C. Caiafa Qianchuan Zhao 6 13 0 25 Apr 2023
Approximately Optimal Core Shapes for Tensor Decompositions Mehrdad Ghadiri Matthew Fahrbach Gang Fu Vahab Mirrokni 6 8 0 08 Feb 2023
Towards Efficient and Accurate Approximation: Tensor Decomposition Based on Randomized Block Krylov Iteration Y. Qiu Weijun Sun Guoxu Zhou Qianchuan Zhao 25 3 0 27 Nov 2022
Sampling-Based Decomposition Algorithms for Arbitrary Tensor Networks Osman Asif Malik V. Bharadwaj Riley Murray 24 4 0 07 Oct 2022
Cost-efficient Gaussian Tensor Network Embeddings for Tensor-structured Inputs Linjian Ma Edgar Solomonik 24 7 0 26 May 2022
Reverse iterative volume sampling for linear regression Michal Derezinski Manfred K. Warmuth 33 43 0 06 Jun 2018