This commit is contained in:
Niyas Mohammed 2020-11-29 20:27:48 +05:30 committed by GitHub
parent fbf27ecdcb
commit a01e1c2ee9
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23

View File

@ -2370,7 +2370,7 @@
"Instead of trying to find the similarity between an image and an \"ideal image,\" we could instead look at each individual pixel and come up with a set of weights for each one, such that the highest weights are associated with those pixels most likely to be black for a particular category. For instance, pixels toward the bottom right are not very likely to be activated for a 7, so they should have a low weight for a 7, but they are likely to be activated for an 8, so they should have a high weight for an 8. This can be represented as a function and set of weight values for each possible category—for instance the probability of being the number 8:\n", "Instead of trying to find the similarity between an image and an \"ideal image,\" we could instead look at each individual pixel and come up with a set of weights for each one, such that the highest weights are associated with those pixels most likely to be black for a particular category. For instance, pixels toward the bottom right are not very likely to be activated for a 7, so they should have a low weight for a 7, but they are likely to be activated for an 8, so they should have a high weight for an 8. This can be represented as a function and set of weight values for each possible category—for instance the probability of being the number 8:\n",
"\n", "\n",
"```\n", "```\n",
"def pr_eight(x,w) = (x*w).sum()\n", "def pr_eight(x,w): return (x*w).sum()\n",
"```" "```"
] ]
}, },