Lost in High-dimensional Space? Python to the Rescue!
summary
Claims that sparse grid combinations cut the exponential blowup of full d‑dimensional grids (example: level 6 corresponds to 2^6=64 -> 65 points per axis in the full grid) and that growth becomes much weaker up to 20 dimensions with thousands of points per axis. Implementation uses Python high‑level control plus numpy (indexing objects, where, unraveling), itertools and simple linear combinations, produces the figures shown, and becomes the basis of the Python Grids and Fields toolkit under development.
AI-written summary · about
chapters (16)
- 0:00Introduction
- 2:00Lost in Highdimensional Space
- 8:10Scale Lattice
- 11:06Intuitive Picture
- 12:19HighLevel Complexity
- 13:50LowLevel Complexity
- 14:21Gridded Field Representation
- 14:57Virtual Linearization
- 15:29Numpy
- 15:50Slice Intrinsic
- 16:24Classic Combination
- 16:50Finding Neighbors
- 17:32Compact Stencil
- 17:59Python Grids and Fields
- 18:48MapReduce Framework
- 19:29Conclusion
related talks
01h 34mAlgorithmic High-Dimensional Geometry I
51mTwo Concise Representations for High-Dimensional Visual Data
01h 04mHigher-dimensional Expansion of Random Geometric Complexes
36mLow-rank matrix approximations in Python
01h 34mAlgorithmic High-Dimensional Geometry II
44mScalable Algorithmic Primitives for Data Science
01h 03mRecent Progress in High-Dimensional Learning
42mDimensionality Reduction Via Sparse Matrices
