WE MUST ADD STRUCTURE TO DEEP LEARNING BECAUSE...
Machine Learning Street TalkCited 3× on HN, 2024-2024
101K views · 2 years ago · podcast · dated
Machine Learning Street Talk interviews Paul Lessard about Categorical Deep Learning, which uses category theory and monads to make neural network architectures more interpretable and composable. They also discuss neural networks' limits in reasoning and unbounded computation.
Mostly cited in passing, e.g. regarding claims that transformers cannot do recursion and as an example of structured deep learning work.
3:07Neural Networks Demystified [Part 1: Data and Architecture]
Welch Labs
838K views • 12 years ago
46:46Category Theory 1.1: Motivation and Philosophy
Bartosz Milewski
394K views • 10 years ago
1:11:41Lecture 1 | Natural Language Processing with Deep Learning
Stanford University School of Engineering
820K views • 9 years ago
24:07AI can't cross this line and we don't know why.
Welch Labs
2.5M views • 2 years ago
1:36:54Category Theory by Tom LaGatta
AI Council
73K views • 12 years ago
12:47Backpropagation, intuitively | Deep Learning Chapter 3
3Blue1Brown
6.4M views • 9 years ago
57:21An Observation on Generalization
Simons Institute for the Theory of Computing
210K views • 3 years ago
1:22:38CS480/680 Lecture 19: Attention and Transformer Networks
Pascal Poupart
374K views • 7 years ago
2:25:52The spelled-out intro to neural networks and backpropagation: building micrograd
Andrej Karpathy
4.4M views • 4 years ago
20:39AI Language Models & Transformers - Computerphile
Computerphile
354K views • 7 years ago
20:33Gradient descent, how neural networks learn | Deep Learning Chapter 2
3Blue1Brown
9.7M views • 9 years ago
1:30:45The Simple Essence of Automatic Differentiation - Conal Elliott
Microsoft Research
17K views • 8 years ago
27:07Attention Is All You Need
Yannic Kilcher
814K views • 8 years ago
1:19:08CS231n Winter 2016: Lecture1: Introduction and Historical Context
Andrej Karpathy
462K views • 10 years ago
25:57GPT3: An Even Bigger Language Model - Computerphile
Computerphile
446K views • 6 years ago
18:40But what is a neural network? | Deep learning chapter 1
3Blue1Brown
25.1M views • 9 years ago
28:48LSTM is dead. Long Live Transformers!
Seattle Applied Deep Learning
540K views • 6 years ago
1:08:40Lecture 1 | Machine Learning (Stanford)
Stanford
2.7M views • 18 years ago
2:35:53Tensorflow and deep learning - without a PhD by Martin Görner
Devoxx
610K views • 10 years ago
1:21:28Lecture 01 - The Learning Problem
caltech
1.5M views • 14 years ago
3 comments from Hacker News
Symbolica.ai | London, Australia | REMOTE, INTERNS, VISA We're trying to apply the insights of category theory, dependent type theory, and functional programming to deep learning. How do we best equip neural nets with strong inductive biases from these fields to help them reason in a structured way? Our upcoming ICML paper gives some flavor link ; you can also watch ▶ this video ; but there is a lot more to say. If you are fluent in 2 or more of { category theory, Haskell (/Idris/Agda/...), deep learning }, you'll probably have a lot of fun with us! Check out our open positions at link
Do you have any citation on lack of funding for foundational research? From the looks of things, it seems like there is insane amount of money in AI and while maybe majority of it goes to "projects with high probability of success", whatever that means, fringe ideas seem to generate good amount of capital as well. Even (what I would consider to be) academic projects seems to get good funding [0]. On top of that, it seems like you're not saying that Transformers might be a dead end but Neural Networks itself might be one. At this point, NNs already gives a lot of value. If someone's goal is to just get products out that say diffusion models already helps you achieve, how is that even a dead end? Do you mean dead end for AGI? In which case, there seems to be research on alternatives there as well? [1] [0] ▶ this video [1] link
Interesting, I thought it was proven Transformers cannot do recursion[0] and aren't actually able to be equivalent to a turing machine due to lack of expandable memory, and are rather finite state automata. [0]: ▶ this video