Hadamard Domain Training with Integers for Class Incremental Quantized Learning
Not on the map. Why?
Abstract (arXiv)
Continual learning is a desirable feature in many modern machine learning applications, which allows in-field adaptation and updating, ranging from accommodating distribution shift, to fine-tuning, and to learning new tasks. For applications with privacy and low latency requirements, the compute and memory demands imposed by continual learning can be cost-prohibitive for resource-constraint edge platforms. Reducing computational precision through fully quantized training (FQT) simultaneously reduces memory footprint and increases compute efficiency for both training and inference. However, aggressive quantization especially integer FQT typically degrades model accuracy to unacceptable levels. In this paper, we propose a technique that leverages inexpensive Hadamard transforms to enable low-precision training with only integer matrix multiplications. We further determine which tensors need stochastic rounding and propose tiled matrix multiplication to enable low-bit width accumulators. We demonstrate the effectiveness of our technique on several human activity recognition datasets and CIFAR100 in a class incremental learning setting. We achieve less than 0.5% and 3% accuracy degradation while we quantize all matrix multiplications inputs down to 4-bits with 8-bit accumulators.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 38 of its 72 references that are in the map. First posted on arXiv 5 Oct 2023.
Builds on
38 of 72 references.
References · 38
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2016Learning without Forgettingcited by 2,465
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
- 2016Progressive Neural Networkscited by 1,332
- 2018Continual Lifelong Learning with Neural Networks: A Reviewcited by 1,313
- 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 882
- 2018Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigencecited by 734
- 2019Large Scale Incremental Learningcited by 727
- 2019Online Continual Learning with Maximally Interfered Retrievalcited by 376
- 2021DER: Dynamically Expandable Representation for Class Incremental Learningcited by 355
- 2019Maintaining Discrimination and Fairness in Class Incremental Learningcited by 281
26 more
- 2023Class-Incremental Learning: A Surveycited by 209
- 2019REMIND Your Neural Network to Prevent Catastrophic Forgettingcited by 197
- 2019What Do Compressed Deep Neural Networks Forget?cited by 164
- 2019Trained Quantization Thresholds for Accurate and Efficient Fixed-Point Inference of Deep Neural Networkscited by 87
- 2020Optimal Continual Learning has Perfect Memory and is NP-hardcited by 86
- 2023Training Transformers with 4-bit Integerscited by 58
- 2022SparCL: Sparse Continual Learning on the Edgecited by 55
- 2019Adjusting Decision Boundary for Class Imbalanced Learningcited by 52
- 2020La-MAML: Look-ahead Meta Learning for Continual Learningcited by 51
- 2020A Statistical Framework for Low-bitwidth Training of Deep Neural Networkscited by 51
- 2022Online Continual Learning for Embedded Devicescited by 48
- 2017Stratified Transfer Learning for Cross-domain Activity Recognitioncited by 40
- 2021A TinyML Platform for On-Device Continual Learning with Quantized Latent Replayscited by 37
- 2021Continual Learning via Bit-Level Information Preservingcited by 32
- 2023FP8 versus INT8 for efficient deep learning inferencecited by 31
- 2021Accurate Neural Training with 4-bit Matrix Multiplications at Standard Formatscited by 26
- 2023SIESTA: Efficient Online Continual Learning with Sleepcited by 24
- 2023How Efficient Are Today's Continual Learning Algorithms?cited by 24
- 2021Continual Learning in Sensor-based Human Activity Recognition: an Empirical Benchmark Analysiscited by 21
- 2023Does Continual Learning Equally Forget All Parameters?cited by 18
- 2021ACAE-REMIND for Online Continual Learning with Compressed Feature Replaycited by 12
- 2021In-Hindsight Quantization Range Estimation for Quantized Trainingcited by 7
- 2023Dynamic Stashing Quantization for Efficient Transformer Trainingcited by 6
- 2023DARKSIDE: A Heterogeneous RISC-V Compute Cluster for Extreme-Edge On-Chip DNN Inference and Trainingcited by 5
- 2021RCT: Resource Constrained Training for Edge AIcited by 1
- 2023Ada-QPacknet -- adaptive pruning with bit width reduction as an efficient continual learning method without forgettingcited by 1
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.