paper-with-me

홈 › Papers

SamBaTen: Sampling-based Batch Incremental Tensor Decomposition

2017-09-03 · Ekta Gujral, Ravdeep Pasricha, Evangelos E. Papalexakis

Tensor decompositions are invaluable tools in analyzing multimodal datasets. In many real-world scenarios, such datasets are far from being static, to the contrary they tend to grow over time. For instance, in an online social network setting, as we observe new interactions over time, our dataset gets updated in its "time" mode. How can we maintain a valid and accurate tensor decomposition of such a dynamically evolving multimodal dataset, without having to re-compute the entire decomposition after every single update? In this paper we introduce SaMbaTen, a Sampling-based Batch Incremental Tensor Decomposition algorithm, which incrementally maintains the decomposition given new updates to the tensor dataset. SaMbaTen is able to scale to datasets that the state-of-the-art in incremental tensor decomposition is unable to operate on, due to its ability to effectively summarize the existing tensor and the incoming updates, and perform all computations in the reduced summary space. We extensively evaluate SaMbaTen using synthetic and real datasets. Indicatively, SaMbaTen achieves comparable accuracy to state-of-the-art incremental and non-incremental techniques, while being 25-30 times faster. Furthermore, SaMbaTen scales to very large sparse and dense dynamically evolving tensors of dimensions up to 100K x 100K x 100K where state-of-the-art incremental approaches were not able to operate.

📄 PDF Abstract BibTeX arXiv:1709.00668

Code (0)

등록된 구현이 없습니다.

Tasks

Tensor Decompositionvalid

Similar Papers 제목 키워드 기반

Grassmannian Optimization for Online Tensor Completion and Tracking with the t-SVD

2020-01-30 · Kyle Gilman, Davoud Ataee Tarzanagh, Laura Balzano

We propose a new fast streaming algorithm for the tensor completion problem of imputing missing entries of a low-tubal-rank tensor using the tensor singular value decomposition (t-SVD) algebraic framework. We show the t-…

Incremental Without Replacement Sampling in Nonconvex Optimization

2020-07-15 · Edouard Pauwels

Minibatch decomposition methods for empirical risk minimization are commonly analysed in a stochastic approximation setting, also known as sampling with replacement. On the other hands modern implementations of such tech…

Dynamic Tensor Decomposition via Neural Diffusion-Reaction Processes

2023-09-21 · NeurIPS 2023 11

Tensor decomposition is an important tool for multiway data analysis. In practice, the data is often sparse yet associated with rich temporal information. Existing methods, however, often under-use the time information a…

Online TT-ALS for Streaming Tensor Decomposition with Incremental Orthogonalization

2026-06-30 · Hiroki Takeda, Yuto Miyatake, Daisuke Furihata arxiv

Tensor Train (TT) decomposition is a powerful technique for analyzing high-dimensional data. Existing algorithms for computing TT decompositions can be categorized into two main types: conventional batch-based approaches…

Computational Efficiency

Optical Coherence Tomography Image Enhancement via Block Hankelization and Low Rank Tensor Network Approximation

2023-06-19 · Farnaz Sedighin, Andrzej Cichocki, Hossein Rabbani

In this paper, the problem of image super-resolution for Optical Coherence Tomography (OCT) has been addressed. Due to the motion artifacts, OCT imaging is usually done with a low sampling rate and the resulting images a…

Image EnhancementImage Super-ResolutionSuper-Resolution