Cover Image

Most Convolutional Networks Suffer from Small Adversarial Perturbations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Daniely, Amit, Mehalel, Idan
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Online Learning of Neural Networks
by: Daniely, Amit, et al.
Published: (2025)

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

Deterministic Apple Tasting
by: Chase, Zachary, et al.
Published: (2024)

Deep Networks Learn Deep Hierarchical Models
by: Daniely, Amit
Published: (2026)

Online Realizable Regression and Applications for ReLU Networks
by: Doron-Arad, Ilan, et al.
Published: (2026)

Sample Complexity of Autoregressive Reasoning: Chain-of-Thought vs. End-to-End
by: Hanneke, Steve, et al.
Published: (2026)

A Tight Lower Bound for Non-stochastic Multi-armed Bandits with Expert Advice
by: Chase, Zachary, et al.
Published: (2025)

On the Sample Complexity of Two-Layer Networks: Lipschitz vs. Element-Wise Lipschitz Activation
by: Daniely, Amit, et al.
Published: (2022)

A Theory of Online Learning with Autoregressive Chain-of-Thought Reasoning
by: Doron-Arad, Ilan, et al.
Published: (2026)

Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension
by: Filmus, Yuval, et al.
Published: (2023)

Bandit-Feedback Online Multiclass Classification: Variants and Tradeoffs
by: Filmus, Yuval, et al.
Published: (2024)

Multiclass Online Learnability under Bandit Feedback
by: Raman, Ananth, et al.
Published: (2023)

RedEx: Beyond Fixed Representation Methods via Convex Optimization
by: Daniely, Amit, et al.
Published: (2024)

Which Alert Removals are Beneficial?
by: Amit, Idan
Published: (2026)

Adversarially Robust PAC Learnability of Real-Valued Functions
by: Attias, Idan, et al.
Published: (2022)

A Large Scale Survey of Motivation in Software Development and Analysis of its Validity
by: Amit, Idan, et al.
Published: (2024)

A Characterization of Semi-Supervised Adversarially-Robust PAC Learnability
by: Attias, Idan, et al.
Published: (2022)

Constrained Adversarial Perturbation
by: Nishad, Virendra, et al.
Published: (2025)

Contrasting Adversarial Perturbations: The Space of Harmless Perturbations
by: Chen, Lu, et al.
Published: (2024)

Unifying Adversarial Perturbation for Graph Neural Networks
by: Yang, Jinluan, et al.
Published: (2025)

Network Inversion of Convolutional Neural Nets
by: Suhail, Pirzada, et al.
Published: (2024)

Optimal sets of questions for Twenty Questions
by: Filmus, Yuval, et al.
Published: (2021)

Graph Adversarial Diffusion Convolution
by: Liu, Songtao, et al.
Published: (2024)

Distributed Learning with Adversarial Gradient Perturbations
by: Sangsiri, Nawapon, et al.
Published: (2026)

On the Effects of Adversarial Perturbations on Distribution Robustness
by: Wang, Yipei, et al.
Published: (2026)

Democratic Training Against Universal Adversarial Perturbations
by: Sun, Bing, et al.
Published: (2025)

Stable Minima of ReLU Neural Networks Suffer from the Curse of Dimensionality: The Neural Shattering Phenomenon
by: Liang, Tongtong, et al.
Published: (2025)

Perturbing the Phase: Analyzing Adversarial Robustness of Complex-Valued Neural Networks
by: Eilers, Florian, et al.
Published: (2026)

Wide Two-Layer Networks can Learn from Adversarial Perturbations
by: Kumano, Soichiro, et al.
Published: (2024)

A Temporal Convolutional Network-based Approach for Network Intrusion Detection
by: Nazre, Rukmini, et al.
Published: (2024)

Follow Your Nose -- Which Code Smells are Worth Chasing?
by: Amit, Idan, et al.
Published: (2021)

Temporally Unified Adversarial Perturbations for Time Series Forecasting
by: Su, Ruixian, et al.
Published: (2026)

Low Rank Adaptation for Adversarial Perturbation
by: Liu, Han, et al.
Published: (2026)

Free Privacy Protection for Wireless Federated Learning: Enjoy It or Suffer from It?
by: Li, Weicai, et al.
Published: (2025)

Certifying Robustness of Graph Convolutional Networks for Node Perturbation with Polyhedra Abstract Interpretation
by: Chen, Boqi, et al.
Published: (2024)

How Worst-Case Are Adversarial Attacks? Linking Adversarial and Perturbation Robustness
by: Rossolini, Giulio
Published: (2026)

Adversarial Bandit Optimization with Globally Bounded Perturbations to Linear Losses
by: Cheng, Zhuoyu, et al.
Published: (2026)

Optimizing the Adversarial Perturbation with a Momentum-based Adaptive Matrix
by: Tao, Wei, et al.
Published: (2025)

Theoretical Understanding of Learning from Adversarial Perturbations
by: Kumano, Soichiro, et al.
Published: (2024)

From Small to Large: A Graph Convolutional Network Approach for Solving Assortment Optimization Problems
by: Li, Guokai, et al.
Published: (2025)