Compact lossy compression of tensors via neural tensor-train decomposition
Abstract Many real-world datasets are represented as tensors, i.e., multi-dimensional arrays of numerical values. Storing them without compression often requires substantial space, which grows exponentially with the order. While many tensor compression algorithms are available, many of them rely on strong data assumptions regarding its order, sparsity, rank, and smoothness. In this work, we propose TensorCodec , a lossy compression algorithm for general tensors that do not necessarily adhere to strong input data assumptions. TensorCodec incorporates three key ideas. The first idea is neural tensor-train decomposition (NTTD) where we integrate a recurrent neural network into Tensor-Train Decomposition to enhance its expressive power and alleviate the limitations imposed by the low-rank assumption. Another idea is to fold the input tensor into a higher-order tensor to reduce the space required by NTTD. Finally, the mode indices of the input tensor are reordered to reveal patterns that can be exploited by NTTD for improved approximation. In addition, we extend TensorCodec to enable the lossy compression of tensors with missing entries, often found in real-world datasets. Our analysis and experiments on 8 real-world datasets demonstrate that TensorCodec is (a) Concise: it gives up to $$7.38 \times $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>7.38</mml:mn> <mml:mo>×</mml:mo> </mml:mrow> </mml:math> more compact compression than the best competitor with similar reconstruction error, (b) Accurate: given the same budget for compressed size, it yields up to $$3.33\times $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>3.33</mml:mn> <mml:mo>×</mml:mo> </mml:mrow> </mml:math> more accurate reconstruction than the best competitor, (c) Scalable: Its empirical compression time is linear in the number of tensor entries, and it reconstructs each entry in logarithmic time. Our code and datasets are available at https://github.com/kbrother/TensorCodec .
Authors
- Jinhong Jung (ORCID: https://orcid.org/0000-0002-5533-1507)
- Kijung Shin (ORCID: https://orcid.org/0000-0002-2872-1526)
- Jihoon Ko (ORCID: https://orcid.org/0000-0002-3223-8318)
- Taehyung Kwon (ORCID: https://orcid.org/0000-0002-6177-7329)
- Jun-Gi Jang (ORCID: https://orcid.org/0000-0001-8328-3920)
Institutions
- Soongsil University (KR)
- Korea Advanced Institute of Science and Technology (KR)
- University of Illinois Urbana-Champaign (US)
- International Graduate School of English (KR)
Publication Details
- Journal
- Knowledge and Information Systems
- Published
- 2024-10-14
- DOI
- https://doi.org/10.1007/s10115-024-02252-x
- Citations
- 1
- Primary Topic
- Tensor decomposition and applications
- Type
- article
- Field-Weighted Citation Impact
- 0.33
Funders
- Korea Meteorological Administration
- National Research Foundation of Korea
- Ministry of Science and ICT, South Korea
- Institute for Information and Communications Technology Promotion