all AI news
Robust optimization for adversarial learning with finite sample complexity guarantees
March 25, 2024, 4:41 a.m. | Andr\'e Bertolace, Konstatinos Gatsis, Kostas Margellos
cs.LG updates on arXiv.org arxiv.org
Abstract: Decision making and learning in the presence of uncertainty has attracted significant attention in view of the increasing need to achieve robust and reliable operations. In the case where uncertainty stems from the presence of adversarial attacks this need is becoming more prominent. In this paper we focus on linear and nonlinear classification problems and propose a novel adversarial training method for robust classifiers, inspired by Support Vector Machine (SVM) margins. We view robustness under …
abstract adversarial adversarial attacks adversarial learning arxiv attacks attention case complexity cs.lg cs.sy decision decision making eess.sy making operations optimization robust sample type uncertainty view
More from arxiv.org / cs.LG updates on arXiv.org
Jobs in AI, ML, Big Data
Software Engineer for AI Training Data (School Specific)
@ G2i Inc | Remote
Software Engineer for AI Training Data (Python)
@ G2i Inc | Remote
Software Engineer for AI Training Data (Tier 2)
@ G2i Inc | Remote
Data Engineer
@ Lemon.io | Remote: Europe, LATAM, Canada, UK, Asia, Oceania
Artificial Intelligence – Bioinformatic Expert
@ University of Texas Medical Branch | Galveston, TX
Lead Developer (AI)
@ Cere Network | San Francisco, US