Fast construction of correcting ensembles for legacy artificial intelligence systems: algorithms and a case study
type: Item
instance of: scholarly article
title: Fast construction of correcting ensembles for legacy artificial intelligence systems: algorithms and a case study
zbMATH Open document ID: 1448.68370
author: I. Tyukin
author: Alexander N. Gorban
author: Stephen R. Green
author: Danil Prokhorov
published in: Information Sciences
publication date: 2020-11-27T00:00:00Z
full work available at URL: https://arxiv.org/abs/1810.05593
Mathematics Subject Classification ID: 68T01
Mathematics Subject Classification ID: 60F05
Mathematics Subject Classification ID: 68T07
Mathematics Subject Classification ID: 68T42
zbMATH DE Number: 7278956
zbMATH Keywords: neural ensembles
zbMATH Keywords: stochastic separation theorems
zbMATH Keywords: perceptron
zbMATH Keywords: artificial intelligence
zbMATH Keywords: measure concentration
describes a project that uses: k-means++
describes a project that uses: AS 136
describes a project that uses: SqueezeNet
describes a project that uses: Net2Net
describes a project that uses: AdaBoost.MH
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2896466118
cites work: Q2934696
cites work: Q3601533
cites work: Q4387224
cites work: Universal approximation bounds for superpositions of a sigmoidal function
cites work: Training a Support Vector Machine in the Primal
cites work: On the mathematical foundations of learning
cites work: A decision-theoretic generalization of on-line learning and an application to boosting
cites work: Cascade generalization
cites work: Stochastic separation theorems
cites work: Blessing of dimensionality: mathematical foundations of the statistical physics of data
cites work: One-trial correction of legacy AI systems and stochastic separation theorems
cites work: Correction of AI systems by linear discriminants: probabilistic foundations
cites work: Metric structures for Riemannian and non-Riemannian spaces. Transl. from the French by Sean Michael Bates. With appendices by M. Katz, P. Pansu, and S. Semmes. Edited by J. LaFontaine and P. Pansu
cites work: Isoperimetry of waists and concentration of maps
cites work: Algorithm AS 136: A K-Means Clustering Algorithm
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: Q4400837
cites work: Quasiorthogonal dimension of Euclidean spaces
cites work: Q5806170
cites work: Q5519782
Wikidata QID: Q128431640
DOI: 10.1016/J.INS.2018.11.057
Recommended article: Correction of AI systems by linear discriminants: probabilistic foundations
Recommended article: One-trial correction of legacy AI systems and stochastic separation theorems
Recommended article: Blessing of dimensionality at the edge and geometry of few-shot learning
Recommended article: Construction of a logical-algebraic corrector to increase the adaptive properties of the \(\Sigma \Pi \)-neuron
Recommended article: General stochastic separation theorems with optimal bounds
description: scientific article; zbMATH DE number 7278956