arXiv Machine Learning

Input-Layer Starvation: Why Per-Layer Pruning Breaks IoT Intrusion Detectors

The paper investigates why per-layer pruning of IoT intrusion detectors can cause severe class-level failures. On the CICIoT2023 dataset, a two-layer convolutional detector pruned at 80% sparsity loses 16 accuracy points and half its macro‑F1, with 17 of 34 classes heavily damaged. The failure is traced to the first layer’s weight starvation, and the authors show that protecting those 192 weights or pruning globally, as well as recomputing normalization statistics, can prevent or repair the collapse.

arXiv Machine Learning
Aug 6

Understanding Fault Tolerance of Adversarially Robust Pruned Models

arXiv:2608. 04173v1 Announce Type: new Abstract: Deep neural networks (DNNs) deployed on resource-constrained neuromorphic hardware face three concurrent challenges: the need for model compression through pruning, vulnerability to adversarial input perturbations, and susceptibility to hardware-induced weight faults such as stuck-at-zero errors.

By Manali Dangarikar, Cory Merkel
arXiv Machine Learning
Sep 7

Privacy Failure in Split-LLM Training, The Returned Gradient Nullifies the Decoys

The paper reports a privacy breach in a two-node split‑LLM training system where the returned gradient reveals which data rows were real, despite the system passing standard privacy checks. By exploiting the fact that decoy rows produce zero gradients, an attacker can identify real rows with 100% accuracy across multiple runs. The authors demonstrate that adding gradient clipping and noise can mitigate the leak, but the system remains vulnerable to several untested attack vectors.

By Georgios Politis, Evangelos Pappas
Hugging Face Trending Papers
Jun 10

Finding Sparse Subnetworks in One Training Cycle via Progressive Magnitude-Based Pruning

Neural network pruning reduces model size by removing less important parameters while aiming to preserve predictive performance. Although the Lottery Ticket Hypothesis (LTH) shows that sparse subnetworks can match dense networks when trained from suitable initializations, its iterative pruning procedure requires multiple complete training cycles.

arXiv Machine Learning
Jul 13

Training, Reading, and Editing Legible Transformers

arXiv:2607. 08946v1 Announce Type: new Abstract: A transformer can be built from operators that are legible by construction -- bounded, named units that read as fuzzy set operations rather than dense activations -- but legibility must be pressed for during training, and the pressure has a failure mode.

By Mark Oskin