Abstract
Two coarse coding schemes are considered: the random subspace scheme of the authors, and the modified Kanerva model of Prager et al. (1993). Some properties and characteristics of these schemes are investigated experimentally and by analysing their geometrical interpretation. Both schemes do not require exponential growth of the binary code dimensionality against that of the input space. The random subspace scheme allows the code density to be independent from the maximal dimensionality of hyper-rectangle receptive fields. It is especially important when low-dimensional receptive fields are required, as with classifiers or approximators of real-world data
