mlsanityData to 7 Oct 2026

MO-SAE:Multi-Objective Stacked Autoencoders Optimization for Edge Anomaly Detection

arXiv 2603.13895 ↗First posted 14 Mar 2026cs.NE cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Stacked AutoEncoders (SAE) have been widely adopted in edge anomaly detection scenarios. However, the resource-intensive nature of SAE can pose significant challenges for edge devices, which are typically resource-constrained and must adapt rapidly to dynamic and changing conditions. Optimizing SAE to meet the heterogeneous demands of real-world deployment scenarios, including high performance under constrained storage, low power consumption, fast inference, and efficient model updates, remains a substantial challenge. To address this, we propose an integrated optimization framework that jointly considers these critical factors to achieve balanced and adaptive system-level optimization. Specifically, we formulate SAE optimization for edge anomaly detection as a multi-objective optimization problem and propose MO-SAE (Multi-Objective Stacked AutoEncoders). The multiple objectives are addressed by integrating model clipping, multi-branch exit design, and a matrix approximation technique. In addition, a multi-objective heuristic algorithm is employed to effectively balance the competing objectives in SAE optimization. Our results demonstrate that the proposed MO-SAE delivers substantial improvements over the original approach. On the x86 architecture, it reduces storage space and power consumption by at least 50%, improves runtime efficiency by no less than 28%, and achieves an 11.8% compression rate, all while maintaining application performance. Furthermore, MO-SAE runs efficiently on edge devices with ARM architecture. Experimental results show a 15% improvement in inference speed, facilitating efficient deployment in cloud-edge collaborative anomaly detection systems.

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

Builds on

15 of 30 references.

References · 15

  1. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  2. 2017BranchyNet: Fast Inference via Early Exiting from Deep Neural Networkscited by 591
  3. 2018HAQ: Hardware-Aware Automated Quantization with Mixed Precisioncited by 426
  4. 2018Detecting Spacecraft Anomalies Using LSTMs and Nonparametric Dynamic Thresholdingcited by 407
  5. 2015Tensorizing Neural Networkscited by 246
  6. 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
  7. 2015Compressing Neural Networks with the Hashing Trickcited by 150
  8. 2022Graph-Augmented Normalizing Flows for Anomaly Detection of Multiple Time Seriescited by 42
  9. 2018Deep k-Means: Re-Training and Parameter Sharing with Harder Cluster Assignments for Compressing Deep Convolutionscited by 33
  10. 2021Time Series Anomaly Detection for Cyber-Physical Systems via Neural System Identification and Bayesian Filteringcited by 31
  11. 2015Compressing Convolutional Neural Networkscited by 25
  12. 2021LegoDNN: Block-grained Scaling of Deep Neural Networks for Mobile Visioncited by 20
3 more
  1. 2022Efficient Quantized Sparse Matrix Operations on Tensor Corescited by 16
  2. 2019Towards Compact ConvNets via Structure-Sparsity Regularized Filter Pruningcited by 14
  3. 2018On Implicit Filter Level Sparsity in Convolutional Neural Networkscited by 9

Built on by

Not cited yet.