mlsanityData to 14 Oct 2026

Morphing-based Compression for Data-centric ML Pipelines

arXiv 2504.11067 ↗First posted 15 Apr 2025cs.DB cs.DC cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Data-centric ML pipelines extend traditional machine learning (ML) pipelines -- of feature transformations and ML model training -- by outer loops for data cleaning, augmentation, and feature engineering to create high-quality input data. Existing lossless matrix compression applies lightweight compression schemes to numeric matrices and performs linear algebra operations such as matrix-vector multiplications directly on the compressed representation but struggles to efficiently rediscover structural data redundancy. Compressed operations are effective at fitting data in available memory, reducing I/O across the storage-memory-cache hierarchy, and improving instruction parallelism. The applied data cleaning, augmentation, and feature transformations provide a rich source of information about data characteristics such as distinct items, column sparsity, and column correlations. In this paper, we introduce BWARE -- an extension of AWARE for workload-aware lossless matrix compression -- that pushes compression through feature transformations and engineering to leverage information about structural transformations. Besides compressed feature transformations, we introduce a novel technique for lightweight morphing of a compressed representation into workload-optimized compressed representations without decompression. BWARE shows substantial end-to-end runtime improvements, reducing the execution time for training data-centric ML pipelines from days to hours.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 26 of its 121 references that are in the map. First posted on arXiv 15 Apr 2025.

Builds on

26 of 121 references.

References · 26

  1. 2018Robustness May Be at Odds with Accuracycited by 880
  2. 2016Quantized Neural Networks: Training Neural Networks with Low Precision Weights and Activationscited by 426
  3. 2017Snorkel: Rapid Training Data Creation with Weak Supervisioncited by 372
  4. 2018LQ-Nets: Learned Quantization for Highly Accurate and Compact Deep Neural Networkscited by 274
  5. 2016Data Programming: Creating Large Training Sets, Quicklycited by 246
  6. 2019A Study of BFLOAT16 for Deep Learning Trainingcited by 232
  7. 2017Advances in Pre-Training Distributed Word Representationscited by 207
  8. 2018Training Deep Neural Networks with 8-bit Floating Point Numberscited by 164
  9. 2019Generative Teaching Networks: Accelerating Neural Architecture Search by Learning to Generate Synthetic Training Datacited by 104
  10. 2020MLIR: A Compiler Infrastructure for the End of Moore's Lawcited by 65
  11. 2019DeepHoyer: Learning Sparser Neural Network with Differentiable Scale-Invariant Sparsity Measurescited by 56
  12. 2017Flexpoint: An Adaptive Numerical Format for Efficient Training of Deep Neural Networkscited by 44
14 more
  1. 2019SystemDS: A Declarative Machine Learning System for the End-to-End Data Science Lifecyclecited by 20
  2. 2017Learning Models over Relational Data using Sparse Tensors and Functional Dependenciescited by 12
  3. 2020The Relational Data Borg is Learningcited by 6
  4. 2018BlinkML: Efficient Maximum Likelihood Estimation with Probabilistic Guaranteescited by 4
  5. 2022Improving Matrix-vector Multiplication via Lossless Grammar-Compressed Matricescited by 4
  6. 2024UniSparse: An Intermediate Language for General Sparse Format Customizationcited by 4
  7. 2024Compilation of Modular and General Sparse Workspacescited by 4
  8. 2017Tuple-oriented Compression for Large-scale Mini-batch Stochastic Gradient Descentcited by 3
  9. 2023High-Ratio Compression for Machine-Generated Datacited by 3
  10. 2020MorphStore: Analytical Query Engine with a Holistic Compression-Enabled Processing Modelcited by 2
  11. 2020Impossibility Results for Grammar-Compressed Linear Algebracited by 1
  12. 2021Number Parsing at a Gigabyte per Secondcited by 1
  13. 2021LEA: A Learned Encoding Advisor for Column Storescited by 1
  14. 2023Grammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed Datacited by 1

Built on by

Not cited yet.