This paper begins with a general theory of error in cross-validation testing of algorithms for supervised learning from examples. It is assumed that the examples are described by attribute-value pairs, where the values are symbolic. Cross-validation requires a set of training examples and a set of testing examples. The value of the attribute that is to be predicted is known to the learner in the training set, but unknown in the testing set. The theory demonstrates that cross-validation error has two components: error on the training set (inaccuracy) and sensitivity to noise (instability). This general theory is then applied to voting in instance-based learning. Given an example in the testing set, a typical instance-based learning algorithm predicts the designated attribute by voting among the k nearest neighbors (the k most similar examples) to the testing example in the training set. Voting is intended to increase the stability (resistance to noise) of instance-based learning, but a theoretical analysis shows that there are circumstances in which voting can be destabilizing. The theory suggests ways to minimize cross-validation error, by insuring that voting is stable and does not adversely affect accuracy.
FedReview: Review and Dispose Poisoned Updates without Validation Datasets or Historic Knowledge
Zhejiang University(浙江大学);Hangzhou High-Tech Zone (Binjiang) Institute of Blockchain and Data Security(杭州高新区(滨江)区块链与数据安全研究院);ZJU-UIUC Institute, Zhejiang University(浙江大学ZJU-UIUC研究院);University of Toronto(多伦多大学)
Filtering out mislabeled training instances using black-box optimization and quantum annealing
LiLz Inc.(LiLz公司);Graduate School of Information Sciences, Tohoku University(东京大学信息科学研究生院);Sigma-i Co., Ltd.(Sigma-i公司);Department of Physics, Institute of Science Tokyo(科学东京系物理系);Research and Education Institute for Semiconductors and Informatics, Kumamoto University(熊本大学半导体与信息学研究教育院)