Finite-resolution similarity functions force a universal tradeoff between identification and generalization, with a predicted 1/n collapse of multi-input capacity.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Bound by semanticity: universal laws governing the generalization-identification tradeoff
Finite-resolution similarity functions force a universal tradeoff between identification and generalization, with a predicted 1/n collapse of multi-input capacity.