Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Achieving adversarial robustness via sparsity

From MaRDI portal
Publication:2127259
Jump to:navigation, search

DOI10.1007/S10994-021-06049-9OpenAlexW3206981768MaRDI QIDQ2127259FDOQ2127259


Authors: Ningyi Liao, Liyao Xiang, Nanyang Ye, Shuo Shao, Pengzhi Chu, Shu-Fan Wang Edit this on Wikidata


Publication date: 20 April 2022

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.05423





zbMATH Keywords

robustnesssparsityadversarial learningneural network pruning


Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)


Cites Work

  • Robustness and generalization
  • Analysis of classifiers' robustness to adversarial perturbations


Cited In (2)

  • Dynamic Cheap Talk for Robust Adversarial Learning
  • How to spread adversarial nodes?

Uses Software

  • DeepFool
  • ThiNet





This page was built for publication: Achieving adversarial robustness via sparsity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2127259)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2127259&oldid=14635770"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 23:11. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki