R. Dwivedi: Revisiting minimum description length complexity in overparameterized models
28:53
Samuel Alexander: Reward-punishment symmetric universal intelligence
21:36
Amir Joudaki: Entropy Maximization with Depth: A Variational Principle for Random Neural Networks
31:31
Peter Bloem: Kolmogorov complexity: approximation, separation and identification
1:10:51
K. Dingle and A. Louis: Why the world is simple ? The AIT coding theorem.
20:18
Why Does Diffusion Work Better than Auto-Regression?
1:44:31
Stanford CS229 I Machine Learning I Building Large Language Models (LLMs)
50:48
Statistical Rethinking 2023 - 01 - The Golem of Prague
1:30:40