Mercurial > cortex

comparison thesis/cortex.org @ 534:39ee58fef9d8

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
spellcheck.
author Robert McIntyre <rlm@mit.edu>
date Sun, 27 Apr 2014 10:17:45 -0400
parents 122524d39652
children 8a5abd51cd4f
comparison
equal deleted inserted replaced
533:122524d39652 534:39ee58fef9d8
2820 2820
2821 Here is the core of a basic empathy algorithm, starting with an 2821 Here is the core of a basic empathy algorithm, starting with an
2822 experience vector: 2822 experience vector:
2823 2823
2824 An /experience-index/ is an index into the grand experience vector 2824 An /experience-index/ is an index into the grand experience vector
2825 that defines the worm's life. It is a timestamp for each set of 2825 that defines the worm's life. It is a time-stamp for each set of
2826 sensations the worm has experienced. 2826 sensations the worm has experienced.
2827 2827
2828 First, group the experience-indices into bins according to the 2828 First, group the experience-indices into bins according to the
2829 similarity of their proprioceptive data. I organize my bins into a 2829 similarity of their proprioceptive data. I organize my bins into a
2830 3 level heirachy. The smallest bins have an approximate size of 2830 3 level hierarchy. The smallest bins have an approximate size of
2831 0.001 radians in all proprioceptive dimensions. Each higher level 2831 0.001 radians in all proprioceptive dimensions. Each higher level
2832 is 10x bigger than the level below it. 2832 is 10x bigger than the level below it.
2833 2833
2834 The bins serve as a hashing function for proprioceptive data. Given 2834 The bins serve as a hashing function for proprioceptive data. Given
2835 a single piece of proprioceptive experience, the bins allow us to 2835 a single piece of proprioceptive experience, the bins allow us to
2836 rapidly find all other similiar experience-indices of past 2836 rapidly find all other similar experience-indices of past
2837 expreience that had a very similiar proprioceptive configuration. 2837 experience that had a very similar proprioceptive configuration.
2838 When looking up a proprioceptive experience, if the smallest bin 2838 When looking up a proprioceptive experience, if the smallest bin
2839 does not match any previous experience, then succesively larger 2839 does not match any previous experience, then successively larger
2840 bins are used until a match is found or we reach the largest bin. 2840 bins are used until a match is found or we reach the largest bin.
2841 2841
2842 Given a sequence of proprioceptive input, I use the bins to 2842 Given a sequence of proprioceptive input, I use the bins to
2843 generate a set of similiar experiencs for each input using the 2843 generate a set of similar experiences for each input using the
2844 tiered proprioceptive bins. 2844 tiered proprioceptive bins.
2845 2845
2846 Finally, to infer sensory data, I select the longest consecutive 2846 Finally, to infer sensory data, I select the longest consecutive
2847 chain of experiences that threads through the sets of similiar 2847 chain of experiences that threads through the sets of similar
2848 experiences. Consecutive experience means that the experiences 2848 experiences. Consecutive experience means that the experiences
2849 appear next to each other in the experience vector. 2849 appear next to each other in the experience vector.
2850 2850
2851 2851
2852 2852