中文
相关论文

相关论文: Geometric Algorithms for $k$-NN Poisoning

200 篇论文

Nearest neighbor-based methods are commonly used for classification tasks and as subroutines of other data-analysis methods. An attacker with the capability of inserting their own data points into the training set can manipulate the…

机器学习 · 计算机科学 2022-08-16 Ara Vartanian , Will Rosenbaum , Scott Alfeld

Many machine learning systems rely on data collected in the wild from untrusted sources, exposing the learning algorithms to data poisoning. Attackers can inject malicious data in the training dataset to subvert the learning process,…

机器学习 · 统计学 2018-10-04 Andrea Paudice , Luis Muñoz-González , Emil C. Lupu

A number of online services nowadays rely upon machine learning to extract valuable information from data collected in the wild. This exposes learning algorithms to the threat of data poisoning, i.e., a coordinate attack in which a fraction…

Data poisoning aims to compromise a machine learning based software component by contaminating its training set to change its prediction results for test inputs. Existing methods for deciding data-poisoning robustness have either poor…

软件工程 · 计算机科学 2023-07-18 Yannan Li , Jingbo Wang , Chao Wang

Machine learning algorithms are vulnerable to poisoning attacks: An adversary can inject malicious points in the training dataset to influence the learning process and degrade the algorithm's performance. Optimal poisoning attacks have…

机器学习 · 计算机科学 2019-09-26 Luis Muñoz-González , Bjarne Pfitzner , Matteo Russo , Javier Carnerero-Cano , Emil C. Lupu

Targeted clean-label data poisoning is a type of adversarial attack on machine learning systems in which an adversary injects a few correctly-labeled, minimally-perturbed samples into the training data, causing a model to misclassify a…

机器学习 · 计算机科学 2020-08-14 Neehar Peri , Neal Gupta , W. Ronny Huang , Liam Fowl , Chen Zhu , Soheil Feizi , Tom Goldstein , John P. Dickerson

The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by at most b. In this paper, we present a 2-approximation…

数据结构与算法 · 计算机科学 2012-05-01 Martin Fürer , Serge Gaspers , Shiva Prasad Kasiviswanathan

We give new results for problems in computational and statistical machine learning using tools from high-dimensional geometry and probability. We break up our treatment into two parts. In Part I, we focus on computational considerations in…

最优化与控制 · 数学 2025-04-24 Naren Sarayu Manoj

In the $k$-cut problem, we are given an edge-weighted graph $G$ and an integer $k$, and have to remove a set of edges with minimum total weight so that $G$ has at least $k$ connected components. The current best algorithms are an…

数据结构与算法 · 计算机科学 2019-03-22 Anupam Gupta , Euiwoong Lee , Jason Li

Poisoning attack is identified as a severe security threat to machine learning algorithms. In many applications, for example, deep neural network (DNN) models collect public data as the inputs to perform re-training, where the input data…

密码学与安全 · 计算机科学 2017-03-07 Chaofei Yang , Qing Wu , Hai Li , Yiran Chen

Machine Learning (ML) models have become a very powerful tool to extract information from large datasets and use it to make accurate predictions and automated decisions. However, ML models can be vulnerable to external attacks, causing them…

机器学习 · 计算机科学 2025-01-14 Monse Guedes-Ayala , Lars Schewe , Zeynep Suvak , Miguel Anjos

In this paper, we proposed a general framework for data poisoning attacks to graph-based semi-supervised learning (G-SSL). In this framework, we first unify different tasks, goals, and constraints into a single formula for data poisoning…

机器学习 · 计算机科学 2019-11-01 Xuanqing Liu , Si Si , Xiaojin Zhu , Yang Li , Cho-Jui Hsieh

Data poisoning attacks, in which a malicious adversary aims to influence a model by injecting "poisoned" data into the training process, have attracted significant recent attention. In this work, we take a closer look at existing poisoning…

机器学习 · 计算机科学 2024-02-16 Yiwei Lu , Gautam Kamath , Yaoliang Yu

This work aims to address an open problem in data valuation literature concerning the efficient computation of Data Shapley for weighted $K$ nearest neighbor algorithm (WKNN-Shapley). By considering the accuracy of hard-label KNN with…

数据结构与算法 · 计算机科学 2024-01-23 Jiachen T. Wang , Prateek Mittal , Ruoxi Jia

State-of-the-art machine learning models are vulnerable to data poisoning attacks whose purpose is to undermine the integrity of the model. However, the current literature on data poisoning attacks is mainly focused on ad hoc techniques…

机器学习 · 计算机科学 2021-02-12 Pooya Tavallali , Vahid Behzadan , Peyman Tavallali , Mukesh Singhal

The experimental design problem concerns the selection of k points from a potentially large design pool of p-dimensional vectors, so as to maximize the statistical efficiency regressed on the selected k design points. Statistical efficiency…

机器学习 · 统计学 2017-11-15 Zeyuan Allen-Zhu , Yuanzhi Li , Aarti Singh , Yining Wang

Graph-based Semi-Supervised Learning (GSSL) is a practical solution to learn from a limited amount of labelled data together with a vast amount of unlabelled data. However, due to their reliance on the known labels to infer the unknown…

机器学习 · 计算机科学 2022-05-12 Adriano Franci , Maxime Cordy , Martin Gubri , Mike Papadakis , Yves Le Traon

Poisoning attacks are a primary threat to machine learning models, aiming to compromise their performance and reliability by manipulating training datasets. This paper introduces a novel attack - Outlier-Oriented Poisoning (OOP) attack,…

机器学习 · 计算机科学 2024-11-04 Anum Paracha , Junaid Arshad , Mohamed Ben Farah , Khalid Ismail

Machine learning algorithms are vulnerable to poisoning attacks, where a fraction of the training data is manipulated to degrade the algorithms' performance. We show that current approaches, which typically assume that regularization…

机器学习 · 计算机科学 2021-05-25 Javier Carnerero-Cano , Luis Muñoz-González , Phillippa Spencer , Emil C. Lupu

Given a graph, the general problem to cover the maximum number of vertices by a collection of vertex-disjoint long paths seemingly escapes from the literature. A path containing at least $k$ vertices is considered long. When $k \le 3$, the…

数据结构与算法 · 计算机科学 2022-08-08 Mingyang Gong , Brett Edgar , Jing Fan , Guohui Lin , Eiji Miyano
‹ 上一页 1 2 3 10 下一页 ›