Clustering Effect of (Linearized) Adversarial Robust Models
Adversarial robustness has received increasing attention along with the study of adversarial examples. So far, existing works show that robust models not only obtain robustness against various adversarial attacks but also boost the performance in some downstream tasks. However, the underlying mechanism of adversarial robustness is still not clear. In this paper, we interpret adversarial robustness from the perspective of linear components, and find that there exist some statistical properties for comprehensively robust models. Specifically, robust models show obvious hierarchical clustering effect on their linearized sub-networks, when removing or replacing all non-linear components (e.g., batch normalization, maximum pooling, or activation layers). Based on these observations, we propose a novel understanding of adversarial robustness and apply it on more tasks including domain adaption and robustness boosting. Experimental evaluations demonstrate the rationality and superiority of our proposed clustering strategy.
Code (1)
Tasks
Adversarial RobustnessClusteringDomain AdaptationSimilar Papers 제목 키워드 기반
Clustering Effect of Adversarial Robust Models
Adversarial robustness has received increasing attention along with the study of adversarial examples. So far, existing works show that robust models not only obtain robustness against various adversarial attacks but als…
Adversarial RobustnessClusteringDomain AdaptationSynchronization Clustering based on a Linearized Version of Vicsek model
This paper presents a kind of effective synchronization clustering method based on a linearized version of Vicsek model. This method can be represented by an Effective Synchronization Clustering algorithm (ESynC), an Imp…
ClusteringLinearized Optimal Transport pyLOT Library: A Toolkit for Machine Learning on Point Clouds
The pyLOT library offers a Python implementation of linearized optimal transport (LOT) techniques and methods to use in downstream tasks. The pipeline embeds probability distributions into a Hilbert space via the Optimal…
ClusteringDimensionality ReductionRevealing Cluster Structures Based on Mixed Sampling Frequencies
This paper proposes a new linearized mixed data sampling (MIDAS) model and develops a framework to infer clusters in a panel regression with mixed frequency data. The linearized MIDAS estimation method is more flexible a…
ClusteringregressionA Min-max Cult Algorithm for Graph Partitioning and Data Clustering
An important application of graph partitioning is data clustering using a graph model - the pairwise similarities between all data objects form a weighted graph adjacency matrix that contains all necessary information fo…
Clusteringgraph partitioning