Issue #232
January 24, 2024
- 1. Free unexpected MIT courses to kick start the new year [medium.com/open-learning]
- 2. Celebrating the Playful Magic of John Horton Conway [quantamagazine.org]
- 3. New Theory Suggests Chatbots Can Understand Text [quantamagazine.org]
- 4. Why is machine learning 'hard'? [ai.stanford.edu]
- 5. Evolution of AI and Amara's Law [n9o.xyz]
- 6. Calculus on Computational Graphs: Backpropagation [colah.github.io]
- 7. Yann LeCun, chief AI scientist at Meta: ‘Human-level artificial intelligence is going to take a long time’ [english.elpais.com]
- • Diversity of information pathways drives sparsity in real-world networks (A. Ghavasieh, M. De Domenico)
- • Comparison of home detection algorithms using smartphone GPS data (R. Verma, S. Mittal, Z. Lei, X. Chen, S. V. Ukkusuri)
- • Modeling teams performance using deep representational learning on graphs (F. Carli, P. Foini, N. Gozzi, N. Perra, R. Schifanella)
- • Percolation and Topological Properties of Temporal Higher-Order Networks (L. Di Gaetano, F. Battiston, M. Starnini)
- • Mission: Impossible Language Models (J. Kallini, I. Papadimitriou, R. Futrell, K. Mahowald, C. Potts)
- • Wallets' explorations across non-fungible token collections (S. Jo, W.-S. Jung, H. Kim)
- • The structure and robustness of ecological networks with two interaction types (V. Domínguez-García, S. Kéfi)
2023's Biggest Breakthroughs in Computer Science
All our videos are also available in our YouTube playlist.
Enjoy the newsletter?
Forward it to a friend, or subscribe to get it straight to your inbox.
Subscribe Free