Skip to content

MC-SNN: Multicenter Stochastic Neural Network for Adversarially Robust Learning.

Aug 2026 · IEEE Transactions on Cybernetics · Vol PP · 0 citations
Medicine

TL;DR

A multicenter learning method that leverages the advantage of stochastic neural networks (SNNs) for feature uncertainty learning and induces multiple centers for each class of samples in latent space to fit data more delicately, named the multicenter SNN (MC-SNN).

Abstract

Enhancing the adversarial robustness of deep neural networks (DNNs) has become a prominent topic in the field of reliable artificial intelligence. Existing methods, no matter with standard training (ST) or adversarial training (AT), usually adopt a regular learning mode that induces a single center for each class of samples in the logit layer. However, due to the complex nature of data, a class of samples may have multiple dense regions, thereby following a mixed Gaussian distribution in latent space. The single-center learning mode makes it difficult for the network to fit data at a fine-grained level, thereby increasing the risks of some samples being located near the classification boundary, which degrades the model's adversarial robustness. In this article, we propose a multicenter learning method for robustness enhancement. It leverages the advantage of stochastic neural networks (SNNs) for feature uncertainty learning and induces multiple centers for each class of samples in latent space to fit data more delicately, named the multicenter SNN (MC-SNN). In addition, four AT-related strategies are introduced to propose MC-SNN-AT, in order to defend against a wider range of attacks. In a series of benchmark tests, both MC-SNN and MC-SNN-AT achieved state-of-the-art robustness. Furthermore, the training cost of MC-SNN is only about one-tenth of vanilla AT.

View source

Similar papers

Aug 2026

Multi-layer Adversarial Robustness Analysis of Neural Networks: Visual and Metric-based Approaches

A method to analyze ANNs designed for image classification from an adversarial robustness perspective and implemented an ablation and fine-tuning strategy that successfully boosted the robustness of the ANNs against a variant of the Auto-PGD attack under different threat models.

Inês Valentim, Nuno Antunes, Nuno Lourenço · 0 citations
Open access Jul 2026

Generative adversarial network-based learning for multi-source heterogeneous data

Experimental results reveal that the FinWGAN-GP model achieves high-fidelity generation and expansion for high-risk samples, and a balanced dataset is conducive to improving the training effect of the early warning model.

Bo Xu, Lifei Lu, Yulin Lu et al. · 0 citations
Preprint Aug 2026

Uncertainty-Aware Ensemble Deep Randomized Neural Networks for Classification

Extensive experiments conducted on UCI and KEEL benchmark datasets demonstrate the superiority of the proposed IF-dRVFL and IF-edRVFL models over existing SOTA fuzzy and non-fuzzy approaches.

M. Sajid, A. Quadir, A. Rahaman et al. · 0 citations
Open access Aug 2026

Adversarial Purification by Consistency-aware Latent Space Optimization on Data Manifolds.

This paper reveals that samples generated by a well-trained generative model are close to clean ones but far from adversarial ones, and proposes Consistency Model-based Adversarial Purification (CMAP), which optimizes vectors within the latent space of a pre-trained consistency model to generate samples for restoring c...

Shuhai Zhang, Jiahao Yang, Hui Luo et al. · 0 citations
Open access Aug 2026

Analysis of adversarial examples in neural network image classifiers

This work explores different neural network architectures, including fully connected networks, classical convolutional networks, and residual networks, under four types of adversarial attacks constrained by different L p norms, and investigates how adversarial examples affect the internal representations of networks...

Jana Poľašková, Iveta Bečková, Stefan Pócos et al. · 0 citations
Preprint Aug 2026

Adversarial Training Without Input Gradients via Low-Rank Householder Expansions

That such a regularizer exists is the main finding: the methods that dispense with the inner search all obtain their local geometry by differentiating with respect to the input, and it is shown this is not necessary.

T. C. Johnson, Donsub Rim · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.