High-Dimensional Separability for One- and Few-Shot Learning
Open Access
Abstract
This work is driven by a practical question: corrections of Artificial Intelligence (AI) errors. These corrections should be quick and non-iterative. To solve this problem without modification of a legacy AI system, we propose special ‘external’ devices, correctors. Elementary correctors consist of two parts, a classifier that separates the situations with high risk of error from the situations in which the legacy AI system works well and a new decision that should be recommended for situations with potential errors. Input signals for the correctors can be the inputs of the legacy AI system, its internal signals, and outputs. If the intrinsic dimensionality of data is high enough then the classifiers for correction of small number of errors can be very simple. According to the blessing of dimensionality effects, even simple and robust Fisher’s discriminants can be used for one-shot learning of AI correctors. Stochastic separation theorems provide the mathematical basis for this one-short learning. However, as the number of correctors needed grows, the cluster structure of data becomes important and a new family of stochastic separation theorems is required. We refuse the classical hypothesis of the regularity of the data distribution and assume that the data can have a rich fine-grained structure with many clusters and corresponding peaks in the probability density. New stochastic separation theorems for data with fine-grained structure are formulated and proved. On the basis of these theorems, the multi-correctors for granular data are proposed. The advantages of the multi-corrector technology were demonstrated by examples of correcting errors and learning new classes of objects by a deep convolutional neural network on the CIFAR-10 dataset. The key problems of the non-classical high-dimensional data analysis are reviewed together with the basic preprocessing steps including the correlation transformation, supervised Principal Component Analysis (PCA), semi-supervised PCA, transfer component analysis, and new domain adaptation PCA.Keywords
All Related Versions
Funding Information
- UK Research and Innovation (Alan Turing AI Acceleration Fellowship EP/V025295/1)
- Ministry of Science and Higher Education of the Russian Federation (075-15-2020-808)
This publication has 93 references indexed in Scilit:
- Copy number variation detection and genotyping from exome sequence dataGenome Research, 2012
- How does multiple testing correction work?Nature Biotechnology, 2009
- A unified framework for semi-supervised dimensionality reductionPattern Recognition, 2008
- Selection Theorem for Systems with InheritanceMathematical Modelling of Natural Phenomena, 2007
- Data dimensionality estimation methods: a surveyPattern Recognition, 2003
- On the mathematical foundations of learningBulletin of the American Mathematical Society, 2001
- Concentration Property on Probability SpacesAdvances in Mathematics, 2000
- Principal pointsBiometrika, 1990
- The Closing LemmaAmerican Journal of Mathematics, 1967
- DIAMETERS OF SETS IN FUNCTION SPACES AND THE THEORY OF BEST APPROXIMATIONSRussian Mathematical Surveys, 1960