Utilizing geometric anomalies of high dimension: When complexity makes computation easier

MaRDI QIDQ4400837zbMATH OpenFDO

Authors Paul C. Kainen

Publication date 25 January 1999

zbMATH Keywords

artificial intelligencebiological controlfeedforward neural networkgeometric problemsheuristicnew technologyparallel computationpattern recognitionrandom graphtopological deployment

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 2237872
• Big data: a geometric explanation of a seemingly counterintuitive strategy
• Computation and learning in high dimensions. Abstracts from the workshop held August 1--7, 2021 (hybrid meeting)
• Breaking the curse of dimensionality
• Estimation in high dimensions: a geometric perspective

Cited in

(6)

• Correction of AI systems by linear discriminants: probabilistic foundations
• Fast construction of correcting ensembles for legacy artificial intelligence systems: algorithms and a case study
• Blessing of dimensionality: mathematical foundations of the statistical physics of data
• Blessing of dimensionality at the edge and geometry of few-shot learning
• General stochastic separation theorems with optimal bounds
• Approximation of classifiers by deep perceptron networks

This page was built for publication: Utilizing geometric anomalies of high dimension: When complexity makes computation easier

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4400837)