Vis enkel innførsel

dc.contributor.authorGorban, Alexander N.
dc.contributor.authorGrechuk, Bogdan
dc.contributor.authorMirkes, Evgeny M.
dc.contributor.authorStasenko, Sergey V.
dc.contributor.authorTyukin, Ivan Yurievich
dc.date.accessioned2023-02-22T10:43:42Z
dc.date.available2023-02-22T10:43:42Z
dc.date.created2021-11-19T13:03:15Z
dc.date.issued2021
dc.identifier.citationEntropy. 2021, 23 (8), .en_US
dc.identifier.issn1099-4300
dc.identifier.urihttps://hdl.handle.net/11250/3053165
dc.description.abstractThis 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.en_US
dc.language.isoengen_US
dc.publisherMDPIen_US
dc.rightsNavngivelse 4.0 Internasjonal*
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/deed.no*
dc.titleHigh-dimensional separability for one-and few-shot learningen_US
dc.title.alternativeHigh-dimensional separability for one-and few-shot learningen_US
dc.typePeer revieweden_US
dc.typeJournal articleen_US
dc.description.versionpublishedVersionen_US
dc.source.volume23en_US
dc.source.journalEntropyen_US
dc.source.issue8en_US
dc.identifier.doi10.3390/e23081090
dc.identifier.cristin1956465
cristin.ispublishedtrue
cristin.fulltextoriginal
cristin.qualitycode1


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel

Navngivelse 4.0 Internasjonal
Med mindre annet er angitt, så er denne innførselen lisensiert som Navngivelse 4.0 Internasjonal