all InfoSec news
Geometric Algorithms for $k$-NN Poisoning. (arXiv:2306.12377v1 [cs.LG])
June 22, 2023, 1:10 a.m. | Diego Ihara Centurion, Karine Chubarian, Bohan Fan, Francesco Sgherzi, Thiruvenkadam S Radhakrishnan, Anastasios Sidiropoulos, Angelo Straight
cs.CR updates on arXiv.org arxiv.org
We propose a label poisoning attack on geometric data sets against
$k$-nearest neighbor classification. We provide an algorithm that can compute
an $\varepsilon n$-additive approximation of the optimal poisoning in $n\cdot
2^{2^{O(d+k/\varepsilon)}}$ time for a given data set $X \in \mathbb{R}^d$,
where $|X| = n$. Our algorithm achieves its objectives through the application
of multi-scale random partitions.
algorithm algorithms application attack classification compute data data sets objectives poisoning
More from arxiv.org / cs.CR updates on arXiv.org
Jobs in InfoSec / Cybersecurity
Sr. Product Manager
@ MixMode | Remote, US
Information Security Engineers
@ D. E. Shaw Research | New York City
Technology Security Analyst
@ Halton Region | Oakville, Ontario, Canada
Senior Cyber Security Analyst
@ Valley Water | San Jose, CA
Incident Response Lead(IR)
@ Blue Yonder | Hyderabad
Comcast Cybersecurity: Privacy Operations Executive Director
@ Comcast | PA - Philadelphia, 1701 John F Kennedy Blvd