paper-with-me

Papers

Sampling-Based Decomposition Algorithms for Arbitrary Tensor Networks

2022-10-07 · Osman Asif Malik, Vivek Bharadwaj, Riley Murray

We show how to develop sampling-based alternating least squares (ALS) algorithms for decomposition of tensors into any tensor network (TN) format. Provided the TN format satisfies certain mild assumptions, resulting algorithms will have input sublinear per-iteration cost. Unlike most previous works on sampling-based ALS methods for tensor decomposition, the sampling in our framework is done according to the exact leverage score distribution of the design matrices in the ALS subproblems. We implement and test two tensor decomposition algorithms that use our sampling framework in a feature extraction experiment where we compare them against a number of other decomposition algorithms.

📄 PDF Abstract BibTeX arXiv:2210.03828

Code (1)

osmanmalik/tns 공식 구현

Tasks

Tensor DecompositionTensor Networks

Methods 이 논문이 사용한 방법론

Test 설명 없음
ALS 설명 없음

Similar Papers 제목 키워드 기반

Randomized Online CP Decomposition

2020-07-21 · Congbo Ma, Xiaowei Yang, Hu Wang

CANDECOMP/PARAFAC (CP) decomposition has been widely used to deal with multi-way data. For real-time or large-scale tensors, based on the ideas of randomized-sampling CP decomposition algorithm and online CP decompositio…

A New Sampling Technique for Tensors

2015-02-17 · Srinadh Bhojanapalli, Sujay Sanghavi

In this paper we propose new techniques to sample arbitrary third-order tensors, with an objective of speeding up tensor algorithms that have recently gained popularity in machine learning. Our main contribution is a new…

Tensor Completion via Leverage Sampling and Tensor QR Decomposition for Network Latency Estimation

2023-06-27 · Jun Lei, Ji-Qian Zhao, Jing-Qi Wang, An-Bao Xu

In this paper, we consider the network latency estimation, which has been an important metric for network performance. However, a large scale of network latency estimation requires a lot of computing time. Therefore, we …

Inductive Convolution Nuclear Norm Minimization for Tensor Completion with Arbitrary Sampling

2026-04-18 · Wei Li, Yuyang Li, Kaile Du, Yi Yu 외 arxiv

The recently established Convolution Nuclear Norm Minimization (CNNM) addresses the problem of \textit{tensor completion with arbitrary sampling} (TCAS), which involves restoring a tensor from a subset of its entries sam…

Multidimensional Data Analysis Based on Block Convolutional Tensor Decomposition

2023-08-03 · Mahdi Molavi, Mansoor Rezghi, Tayyebeh Saeedi

Tensor decompositions are powerful tools for analyzing multi-dimensional data in their original format. Besides tensor decompositions like Tucker and CP, Tensor SVD (t-SVD) which is based on the t-product of tensors is a…

Tensor Decomposition