definition
Curse of dimensionality breaks distance-based similarity
As the number of dimensions (features) grows, distance-based methods like k-nearest-neighbor fail because in high dimensions everything is roughly as far from everything else, so the notion that similar data points are closer than dissimilar ones collapses—this is the curse of dimensionality, predating and orthogonal to neural networks.
definitionpending
Speaker
Anil AnanthaswamyEvidence Quote
“in high dimensions everything is as far away as everything else. So the notion of similarity and dissimilarity just doesn't work anymore. And that, in a very simple way, is the curse of dimensionality.”
Created: 6/13/2026, 12:20:04 AM
Your notes
Loading notes...