arXiv AI

Extraction meets Distillation - cryptanalytic techniques to recover parameters from a Deep Neural Network

The paper investigates reconstructing fully connected neural networks by combining cryptanalytic weight-direction extraction with learning from predicted labels. It adapts ReLU extraction to Leaky ReLU, compares sign-search methods, and estimates biases and output layers, proving conditional bounds for direction recovery and sign selection. Experiments show that Leaky ReLU can recover 51–57 neurons in the deepest hidden layer of a large synthetic architecture, while ReLU recovers none, and that reconstructed models on CIFAR‑10 achieve high prediction agreement and outperform a distillation baseline on several functional metrics.

arXiv AI
Jun 18

Revealing Hidden Vulnerabilities in Autoencoders through Gradient Signal Restoration

arXiv:2505. 03646v5 Announce Type: replace-cross Abstract: Adversarial robustness of deep autoencoders (AEs) has received less attention than that of discriminative models, although their compressed latent representations induce ill-conditioned mappings that can amplify small input perturbations and destabilize reconstructions.

By Chethan Krishnamurthy Ramanaik, Arjun Roy, Tobias Callies, Eirini Ntoutsi
arXiv Computer Vision
Sep 18

Fast Preemptive Robustification: High-Frequency Response Anti-Aligns Shared Vulnerability

The paper introduces Fast Preemptive Robustification (FPR), a lightweight defense that enhances the robustness of deep neural networks against transferable adversarial attacks. By sharpening Laplacian responses through a single 3×3 channel‑wise convolution, FPR eliminates the need for surrogate models, iterative optimization, or specialized training. Experiments show that FPR lowers untargeted attack success rates by 12.7% and reduces targeted attack success from 10.7% to 4.1%.

By Jiaming Liang, Chi-Man Pun
arXiv Machine Learning
Oct 3

The Conflict Between Logic and Memory: Learning Higher-Order Interactions in Shallow MLPs

The paper investigates how single‑hidden‑layer MLPs can fit training data yet fail to recover the underlying rule, focusing on higher‑order interactions and nuisance inputs. Using synthetic parity tasks, the authors benchmark different optimizers (SGD, Adam, Muon) and show that while all achieve perfect accuracy on second‑order interactions, performance drops sharply for higher orders, with Muon outperforming the others at fourth order. Experiments also reveal that freezing or removing nuisance‑related weights dramatically alters training outcomes, highlighting the role of nuisance learning in shaping the rules a shallow network can represent.

By Gongyue Zhang, Honghai Liu