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
Digital Over-the-Air Federated Learning in Multi-Antenna Systems
2 days, 10 hours ago |
arxiv.org
Bagging Provides Assumption-free Stability
2 days, 10 hours ago |
arxiv.org
Jobs in AI, ML, Big Data
Data Architect
@ University of Texas at Austin | Austin, TX
Data ETL Engineer
@ University of Texas at Austin | Austin, TX
Lead GNSS Data Scientist
@ Lurra Systems | Melbourne
Senior Machine Learning Engineer (MLOps)
@ Promaton | Remote, Europe
Field Sample Specialist (Air Sampling) - Eurofins Environment Testing – Pueblo, CO
@ Eurofins | Pueblo, CO, United States
Camera Perception Engineer
@ Meta | Sunnyvale, CA