mlsanityData to 14 Oct 2026

ReLATE: Accelerating Tensor Decomposition via Safe and Efficient Learning of Sparse Encodings

arXiv 2509.00280 ↗First posted 29 Aug 2025cs.LG cs.DC cs.PFcited by 0

Not on the map. Why?

Abstract (arXiv)

Tensor decomposition (TD) is essential for analyzing high-dimensional sparse data, yet its irregular computations and memory-access patterns pose major performance challenges on modern parallel processors. Prior works rely on expert-designed sparse tensor formats that fail to adapt to irregular tensor shapes and data distributions. We present the reinforcement-learned adaptive tensor encoding (ReLATE) framework, a learning-augmented method that discovers safe and efficient sparse encodings, without labeled examples, via a hybrid model-free and model-based algorithm that learns from both real and imagined actions. Moreover, ReLATE introduces elastic training, rule-driven action masking, and dynamics-informed action filtering to ensure correct encoding with bounded execution time, even during early learning. After offline training, with geometric-mean overhead of only 5.82% relative to TD workflow time, ReLATE deploys the best encoding with zero inference overhead. Across diverse real-world sparse tensors, ReLATE consistently outperforms the best expert-designed format by up to 2x, with a geometric-mean speedup of 1.38-1.41x.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 16 of its 62 references that are in the map. First posted on arXiv 29 Aug 2025.

Builds on

16 of 62 references.

References · 16

  1. 2013Playing Atari with Deep Reinforcement Learningcited by 3,274
  2. 2015Deep Reinforcement Learning with Double Q-learningcited by 1,745
  3. 2015Prioritized Experience Replaycited by 1,099
  4. 2017Rainbow: Combining Improvements in Deep Reinforcement Learningcited by 786
  5. 2016Tensor Decomposition for Signal Processing and Machine Learningcited by 224
  6. 2020Algorithms with Predictionscited by 153
  7. 2021Tensor Methods in Computer Vision and Deep Learningcited by 52
  8. 2020Static Neural Compiler Optimization via Deep Reinforcement Learningcited by 14
  9. 2023Tensor Decomposition for Model Reduction in Neural Networks: A Reviewcited by 14
  10. 2019Reinforcement Learning and Adaptive Sampling for Optimized DNN Compilationcited by 9
  11. 2019Load-Balanced Sparse MTTKRP on GPUscited by 5
  12. 2021ALTO: Adaptive Linearized Storage of Sparse Tensorscited by 4
4 more
  1. 2025Deep Reinforcement Learning for Job Scheduling and Resource Management in Cloud Computing: An Algorithm-Level Reviewcited by 4
  2. 2022Efficient, Out-of-Memory Sparse MTTKRP on Massively Parallel Architecturescited by 1
  3. 2023Optimizing Sparse Linear Algebra Through Automatic Format Selection and Machine Learningcited by 1
  4. 2024Accelerating Sparse Tensor Decomposition Using Adaptive Linearized Representationcited by 1

Built on by

Not cited yet.