mlsanityData to 7 Oct 2026

MCEL: Margin-Based Cross-Entropy Loss for Error-Tolerant Quantized Neural Networks

arXiv 2603.05048 ↗First posted 5 Mar 2026cs.LG cs.ARcited by 1

Not on the map. Why?

Abstract (arXiv)

Robustness to bit errors is a key requirement for the reliable use of neural networks (NNs) on emerging approximate computing platforms and error-prone memory technologies. A common approach to achieve bit error tolerance in NNs is injecting bit flips during training according to a predefined error model. While effective in certain scenarios, training-time bit flip injection introduces substantial computational overhead, often degrades inference accuracy at high error rates, and scales poorly for larger NN architectures. These limitations make error injection an increasingly impractical solution for ensuring robustness on future approximate computing platforms and error-prone memory technologies. In this work, we investigate the mechanisms that enable NNs to tolerate bit errors without relying on error-aware training. We establish a direct connection between bit error tolerance and classification margins at the output layer. Building on this insight, we propose a novel loss function, the Margin Cross-Entropy Loss (MCEL), which explicitly promotes logit-level margin separation while preserving the favorable optimization properties of the standard cross-entropy loss. Furthermore, MCEL introduces an interpretable margin parameter that allows robustness to be tuned in a principled manner. Extensive experimental evaluations across multiple datasets of varying complexity, diverse NN architectures, and a range of quantization schemes demonstrate that MCEL substantially improves bit error tolerance, up to 15 % in accuracy for an error rate of 1 %. Our proposed MCEL method is simple to implement, efficient, and can be integrated as a drop-in replacement for standard CEL. It provides a scalable and principled alternative to training-time bit flip injection, offering new insights into the origins of NN robustness and enabling more efficient deployment on approximate computing and memory systems.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 15 of its 34 references that are in the map. First posted on arXiv 5 Mar 2026.

Builds on

15 of 34 references.

References · 15

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  3. 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
  4. 2018CosFace: Large Margin Cosine Loss for Deep Face Recognitioncited by 968
  5. 2022Hardware Approximate Techniques for Deep Neural Network Accelerators: A Surveycited by 39
  6. 2019ALWANN: Automatic Layer-Wise Approximation of Deep Neural Network Accelerators without Retrainingcited by 28
  7. 2019EDEN: Enabling Energy-Efficient, High-Performance Deep Neural Network Inference Using Approximate DRAMcited by 24
  8. 2021SphereFace Revived: Unifying Hyperspherical Face Recognitioncited by 23
  9. 2019MoBiNet: A Mobile Binary Network for Image Classificationcited by 15
  10. 2018On the Universal Approximation Property and Equivalence of Stochastic Computing-based Neural Networks and Binary Neural Networkscited by 4
  11. 2019Implementing Binarized Neural Networks with Magnetoresistive RAM without Error Correctioncited by 3
  12. 2021Binarized ResNet: Enabling Robust Automatic Modulation Classification at the resource-constrained Edgecited by 3
3 more
  1. 2021Bit Error Tolerance Metrics for Binarized Neural Networkscited by 2
  2. 2020Towards Explainable Bit Error Tolerance of Resistive RAM-Based Binarized Neural Networkscited by 1
  3. 2025AxOSyn: An Open-source Framework for Synthesizing Novel Approximate Arithmetic Operatorscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.