Don’t worry, you’re not the only one who has difficulty reading Hinton’s papers. They are quite confusing. The problem is that while there are only two or three big important ideas, they’re spread out over the course of something like 20 papers.
This post makes me think we should have a LW math/ai/machine learning reading group. Choose a paper, read it, someone summarizes it in a main post, and then every one else chimes in with their 2c.
This post makes me think we should have a LW math/ai/machine learning reading group. Choose a paper, read it, someone summarizes it in a main post, and then every one else chimes in with their 2c.
Great idea! Also, make a list the links to these articles accessible from the Wiki. It would also be a great opportunity to apply the LW filters (as applicable to the situation) like:
-What regularity of the search space does the algorithm exploit?
-Why does the algorithm appear to make use of randomness, and how can it be derandomized?
-What phenomena does this theory rule out?
I’m sure there are some ways I could contribute, esp. with the Perceptual Control Theory stuff going around. I’m almost done with the four BYTE magazine articles on it that pjeby keeps referring to.
That sounds good, but in my experience with paper reading groups, most people don’t find the time to actually read the material under discussion. It ends up being a venue for signalling and socializing. Maybe that wouldn’t apply here.
Don’t worry, you’re not the only one who has difficulty reading Hinton’s papers. They are quite confusing. The problem is that while there are only two or three big important ideas, they’re spread out over the course of something like 20 papers.
This post makes me think we should have a LW math/ai/machine learning reading group. Choose a paper, read it, someone summarizes it in a main post, and then every one else chimes in with their 2c.
Great idea! Also, make a list the links to these articles accessible from the Wiki. It would also be a great opportunity to apply the LW filters (as applicable to the situation) like:
-What regularity of the search space does the algorithm exploit? -Why does the algorithm appear to make use of randomness, and how can it be derandomized? -What phenomena does this theory rule out?
I’m sure there are some ways I could contribute, esp. with the Perceptual Control Theory stuff going around. I’m almost done with the four BYTE magazine articles on it that pjeby keeps referring to.
That sounds good, but in my experience with paper reading groups, most people don’t find the time to actually read the material under discussion. It ends up being a venue for signalling and socializing. Maybe that wouldn’t apply here.