all AI news
BruSLeAttack: A Query-Efficient Score-Based Black-Box Sparse Adversarial Attack
April 9, 2024, 4:42 a.m. | Viet Quoc Vo, Ehsan Abbasnejad, Damith C. Ranasinghe
cs.LG updates on arXiv.org arxiv.org
Abstract: We study the unique, less-well understood problem of generating sparse adversarial samples simply by observing the score-based replies to model queries. Sparse attacks aim to discover a minimum number-the l0 bounded-perturbations to model inputs to craft adversarial examples and misguide model decisions. But, in contrast to query-based dense attack counterparts against black-box models, constructing sparse adversarial perturbations, even when models serve confidence score information to queries in a score-based setting, is non-trivial. Because, such an …
abstract adversarial adversarial examples aim arxiv attacks box contrast craft cs.cr cs.lg decisions examples inputs queries query samples study type
More from arxiv.org / cs.LG updates on 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
Business Data Scientist, gTech Ads
@ Google | Mexico City, CDMX, Mexico
Lead, Data Analytics Operations
@ Zocdoc | Pune, Maharashtra, India