Twitter | Pretraživanje | |
Tejas Kulkarni 14. ožu
Odgovor korisniku/ci @ilyasut @jachiam0
"The two methods that seem to scale arbitrarily in this way are search and learning" - search and learn using what primitives? they won't fall out of the sky
Reply Retweet Označi sa "sviđa mi se"
Tejas Kulkarni 14. ožu
Odgovor korisniku/ci @ilyasut @jachiam0
even if do fall, they will first land inside your head and therefore the right inductive biases that scale are key.
Reply Retweet Označi sa "sviđa mi se"
Natesh Ganesh 14. ožu
Odgovor korisniku/ci @ilyasut @jachiam0
1/2 "The ultimate reason for this is Moore's law"- this is key! Moores law is reaching its inevitable end and if need for AI compute doubles every 3.5 mnths, not quite how long this idea of 'compute always wins' is sustainable for economic & enviromental reasons.
Reply Retweet Označi sa "sviđa mi se"
Natesh Ganesh 14. ožu
Odgovor korisniku/ci @ilyasut @jachiam0
2/2 Computing is 5% of US's energy budget. We simply cannot have that go up by a factor of even 5.
Reply Retweet Označi sa "sviđa mi se"
Aurélien Geron 15. ožu
Odgovor korisniku/ci @ilyasut @jachiam0
Yes! Compute always wins. How do we apply this bitter lesson to problems where little data is available? Currently, we try to build a model that encodes our prior knowledge. Perhaps we should instead build a system that searches for relevant knowledge and builds the model?
Reply Retweet Označi sa "sviđa mi se"
Nicholas Guttenberg 15. ožu
Odgovor korisniku/ci @ilyasut @jachiam0
I don't even think this is just Moore's law. In science there's often a point where you can only make progress by explicitly separating out the stuff that you won't be able to say anything simple about from the things you can, but that stuff still exists and must be dealt with.
Reply Retweet Označi sa "sviđa mi se"
Nicholas Guttenberg 15. ožu
Odgovor korisniku/ci @ilyasut @jachiam0
And in some cases, you can strongly prove that no simple outcome can be reached that contains everything - for example, the generalized N-body problem being analytically intractable even if it's statistically approachable.
Reply Retweet Označi sa "sviđa mi se"
Marc 14. ožu
Odgovor korisniku/ci @ilyasut @jachiam0
OK, so we want to avoid relying on domain-specific knowledge and instead look for meta-methods that can learn for themselves? All well and good, but these meta-methods (e.g., search) themselves rely on theoretical insight, without which, compute power can't be harnessed.
Reply Retweet Označi sa "sviđa mi se"
David Speck 15. ožu
Odgovor korisniku/ci @zarzuelazen @ilyasut @jachiam0
I agree. That post talks about the unimportance of domain knowledge. But in opinion my AI research is about finding general improvement to algorithm. More compute + better algorithms is behind the success AI imho. Not compute alone.
Reply Retweet Označi sa "sviđa mi se"