Image de couverture de livre

Most Convolutional Networks Suffer from Small Adversarial Perturbations

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Daniely, Amit, Mehalel, Idan
Format:	Preprint
Publié:	2026
Sujets:	Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Online Learning of Neural Networks
par: Daniely, Amit, et autres
Publié: (2025)

Existence of Adversarial Examples for Random Convolutional Networks via Isoperimetric Inequalities on $\mathbb{so}(d)$
par: Daniely, Amit
Publié: (2025)

Deterministic Apple Tasting
par: Chase, Zachary, et autres
Publié: (2024)

Deep Networks Learn Deep Hierarchical Models
par: Daniely, Amit
Publié: (2026)

Online Realizable Regression and Applications for ReLU Networks
par: Doron-Arad, Ilan, et autres
Publié: (2026)

Sample Complexity of Autoregressive Reasoning: Chain-of-Thought vs. End-to-End
par: Hanneke, Steve, et autres
Publié: (2026)

A Tight Lower Bound for Non-stochastic Multi-armed Bandits with Expert Advice
par: Chase, Zachary, et autres
Publié: (2025)

On the Sample Complexity of Two-Layer Networks: Lipschitz vs. Element-Wise Lipschitz Activation
par: Daniely, Amit, et autres
Publié: (2022)

A Theory of Online Learning with Autoregressive Chain-of-Thought Reasoning
par: Doron-Arad, Ilan, et autres
Publié: (2026)

Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension
par: Filmus, Yuval, et autres
Publié: (2023)

Bandit-Feedback Online Multiclass Classification: Variants and Tradeoffs
par: Filmus, Yuval, et autres
Publié: (2024)

Multiclass Online Learnability under Bandit Feedback
par: Raman, Ananth, et autres
Publié: (2023)

RedEx: Beyond Fixed Representation Methods via Convex Optimization
par: Daniely, Amit, et autres
Publié: (2024)

Which Alert Removals are Beneficial?
par: Amit, Idan
Publié: (2026)

Adversarially Robust PAC Learnability of Real-Valued Functions
par: Attias, Idan, et autres
Publié: (2022)

A Large Scale Survey of Motivation in Software Development and Analysis of its Validity
par: Amit, Idan, et autres
Publié: (2024)

A Characterization of Semi-Supervised Adversarially-Robust PAC Learnability
par: Attias, Idan, et autres
Publié: (2022)

Constrained Adversarial Perturbation
par: Nishad, Virendra, et autres
Publié: (2025)

Contrasting Adversarial Perturbations: The Space of Harmless Perturbations
par: Chen, Lu, et autres
Publié: (2024)

Unifying Adversarial Perturbation for Graph Neural Networks
par: Yang, Jinluan, et autres
Publié: (2025)

Network Inversion of Convolutional Neural Nets
par: Suhail, Pirzada, et autres
Publié: (2024)

Optimal sets of questions for Twenty Questions
par: Filmus, Yuval, et autres
Publié: (2021)

Graph Adversarial Diffusion Convolution
par: Liu, Songtao, et autres
Publié: (2024)

Distributed Learning with Adversarial Gradient Perturbations
par: Sangsiri, Nawapon, et autres
Publié: (2026)

On the Effects of Adversarial Perturbations on Distribution Robustness
par: Wang, Yipei, et autres
Publié: (2026)

Democratic Training Against Universal Adversarial Perturbations
par: Sun, Bing, et autres
Publié: (2025)

Stable Minima of ReLU Neural Networks Suffer from the Curse of Dimensionality: The Neural Shattering Phenomenon
par: Liang, Tongtong, et autres
Publié: (2025)

Perturbing the Phase: Analyzing Adversarial Robustness of Complex-Valued Neural Networks
par: Eilers, Florian, et autres
Publié: (2026)

Wide Two-Layer Networks can Learn from Adversarial Perturbations
par: Kumano, Soichiro, et autres
Publié: (2024)

A Temporal Convolutional Network-based Approach for Network Intrusion Detection
par: Nazre, Rukmini, et autres
Publié: (2024)

Follow Your Nose -- Which Code Smells are Worth Chasing?
par: Amit, Idan, et autres
Publié: (2021)

Temporally Unified Adversarial Perturbations for Time Series Forecasting
par: Su, Ruixian, et autres
Publié: (2026)

Low Rank Adaptation for Adversarial Perturbation
par: Liu, Han, et autres
Publié: (2026)

Free Privacy Protection for Wireless Federated Learning: Enjoy It or Suffer from It?
par: Li, Weicai, et autres
Publié: (2025)

Certifying Robustness of Graph Convolutional Networks for Node Perturbation with Polyhedra Abstract Interpretation
par: Chen, Boqi, et autres
Publié: (2024)

How Worst-Case Are Adversarial Attacks? Linking Adversarial and Perturbation Robustness
par: Rossolini, Giulio
Publié: (2026)

Adversarial Bandit Optimization with Globally Bounded Perturbations to Linear Losses
par: Cheng, Zhuoyu, et autres
Publié: (2026)

Optimizing the Adversarial Perturbation with a Momentum-based Adaptive Matrix
par: Tao, Wei, et autres
Publié: (2025)

Theoretical Understanding of Learning from Adversarial Perturbations
par: Kumano, Soichiro, et autres
Publié: (2024)

From Small to Large: A Graph Convolutional Network Approach for Solving Assortment Optimization Problems
par: Li, Guokai, et autres
Publié: (2025)