Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2510.00083v1

Help | Advanced Search

Computer Science > Computer Vision and Pattern Recognition

arXiv:2510.00083v1 (cs)
[Submitted on 30 Sep 2025 ]

Title: Enhancing Certifiable Semantic Robustness via Robust Pruning of Deep Neural Networks

Title: 通过深度神经网络的鲁棒剪枝增强可认证语义鲁棒性

Authors:Hanjiang Hu, Bowei Li, Ziwei Wang, Tianhao Wei, Casidhe Hutchison, Eric Sample, Changliu Liu
Abstract: Deep neural networks have been widely adopted in many vision and robotics applications with visual inputs. It is essential to verify its robustness against semantic transformation perturbations, such as brightness and contrast. However, current certified training and robustness certification methods face the challenge of over-parameterization, which hinders the tightness and scalability due to the over-complicated neural networks. To this end, we first analyze stability and variance of layers and neurons against input perturbation, showing that certifiable robustness can be indicated by a fundamental Unbiased and Smooth Neuron metric (USN). Based on USN, we introduce a novel neural network pruning method that removes neurons with low USN and retains those with high USN, thereby preserving model expressiveness without over-parameterization. To further enhance this pruning process, we propose a new Wasserstein distance loss to ensure that pruned neurons are more concentrated across layers. We validate our approach through extensive experiments on the challenging robust keypoint detection task, which involves realistic brightness and contrast perturbations, demonstrating that our method achieves superior robustness certification performance and efficiency compared to baselines.
Abstract: 深度神经网络已被广泛应用于许多具有视觉输入的视觉和机器人应用中。 验证其对语义变换扰动(如亮度和对比度)的鲁棒性至关重要。 然而,当前的认证训练和鲁棒性认证方法面临参数过多的问题,这由于神经网络过于复杂而阻碍了紧致性和可扩展性。 为此,我们首先分析了层和神经元对输入扰动的稳定性和方差,表明可认证的鲁棒性可以通过一个基本的无偏和平滑神经元指标(USN)来指示。 基于USN,我们引入了一种新的神经网络剪枝方法,移除USN较低的神经元并保留USN较高的神经元,从而在不参数过多的情况下保持模型的表达能力。 为了进一步增强这一剪枝过程,我们提出了一种新的Wasserstein距离损失,以确保剪枝后的神经元在各层中更加集中。 我们通过在具有挑战性的鲁棒关键点检测任务上的大量实验验证了我们的方法,该任务涉及真实的亮度和对比度扰动,结果表明,与基线方法相比,我们的方法在鲁棒性认证性能和效率方面表现更优。
Subjects: Computer Vision and Pattern Recognition (cs.CV) ; Machine Learning (cs.LG)
Cite as: arXiv:2510.00083 [cs.CV]
  (or arXiv:2510.00083v1 [cs.CV] for this version)
  https://doi.org/10.48550/arXiv.2510.00083
arXiv-issued DOI via DataCite

Submission history

From: Hanjiang Hu [view email]
[v1] Tue, 30 Sep 2025 05:50:29 UTC (606 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
cs.CV
< prev   |   next >
new | recent | 2025-10
Change to browse by:
cs
cs.LG

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号