Abstract
High-dimensional data and high-dimensional representations of reality are inherent features of modern Artificial Intelligence systems and applications of machine learning. The well-known phenomenon of the “curse of dimensionality” states: many problems become exponentially difficult in high dimensions. Recently, the other side of the coin, the “blessing of dimensionality”, has attracted much attention. It turns out that generic high-dimensional datasets exhibit fairly simple geometric properties. Thus, there is a fundamental tradeoff between complexity and simplicity in high dimensional spaces. Here we present a brief explanatory review of recent ideas, results and hypotheses about the blessing of dimensionality and related simplifying effects relevant to machine learning and neuroscience.
Subject
General Physics and Astronomy
Reference71 articles.
1. Dynamic Programming;Bellman,1957
2. The theory of dynamic programming
3. Reduction of Dimensionality, Dynamic Programming, and Control Processes
4. Model Reduction and Coarse–Graining Approaches for Multiscale Phenomena,2006
5. Principal Component Analysis;Jolliffe,1993
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献