all InfoSec news
Sound and Complete Verification of Polynomial Networks. (arXiv:2209.07235v1 [cs.LG])
Sept. 16, 2022, 1:20 a.m. | Elias Abad Rocamora, Mehmet Fatih Sahin, Fanghui Liu, Grigorios G Chrysos, Volkan Cevher
cs.CR updates on arXiv.org arxiv.org
Polynomial Networks (PNs) have demonstrated promising performance on face and
image recognition recently. However, robustness of PNs is unclear and thus
obtaining certificates becomes imperative for enabling their adoption in
real-world applications. Existing verification algorithms on ReLU neural
networks (NNs) based on branch and bound (BaB) techniques cannot be trivially
applied to PN verification. In this work, we devise a new bounding method,
equipped with BaB for global convergence guarantees, called VPN. One key
insight is that we obtain much …
More from arxiv.org / cs.CR updates on arXiv.org
One-shot Empirical Privacy Estimation for Federated Learning
1 day, 3 hours ago |
arxiv.org
Transferability Ranking of Adversarial Examples
1 day, 3 hours ago |
arxiv.org
A survey on hardware-based malware detection approaches
1 day, 3 hours ago |
arxiv.org
Explainable Ponzi Schemes Detection on Ethereum
1 day, 3 hours ago |
arxiv.org
Jobs in InfoSec / Cybersecurity
SOC 2 Manager, Audit and Certification
@ Deloitte | US and CA Multiple Locations
Information Security Engineers
@ D. E. Shaw Research | New York City
Cyber Security Architect - SR
@ ERCOT | Taylor, TX
SOC Analyst
@ Wix | Tel Aviv, Israel
Associate Director, SIEM & Detection Engineering(remote)
@ Humana | Remote US
Senior DevSecOps Architect
@ Computacenter | Birmingham, GB, B37 7YS