Dashboard

Featured nodes

Roots

  • Public root

Templates

  • Test template
  • iCorps template
  • Guanyu's Latex template
  • Ivar's latex template
  • Family Tree template
  • Latex template
  • Router template

Trees

  • Public trees

Orphans

  • Browse orphan nodes
Related nodes

Parents1

  • history and in-depth of AI

Siblings5
  • Sort by title
  • Sort by date

  • Areas of AI
  • AI and economics
  • AI and Big Data - 2020-21
  • initial theories of DL
  • On intelligence

Children3
  • Sort by title
  • Sort by date

  • Information compression
  • geometry of AI
  • AI and Information Theory
Knowenβ
  • Help
    • Welcome to Knowen!
    • Edit test node (no login required)
    • Create new test node (no login required)
  • Not logged in
    • Sign in
    • Sign up

History & Comments

Back

p

Author:Mihail Turlakov
Description:
# a theoryinitial theories of AIDL 


## 2019 [The unreasonable effectiveness of deep learning in artificial intelligence](https://www.pnas.org/content/117/48/30033) Terrence J. Sejnowski

## [RG and Deep Learning](https://www.quantamagazine.org/deep-learning-relies-on-renormalization-physicists-find-20141204/)

> The new work, completed by Pankaj Mehta of Boston University and David Schwab of Northwestern University, demonstrates that a statistical technique called “renormalization,” which allows physicists to accurately describe systems without knowing the exact state of all their component parts

- [Learning hierarchical category structure in deep neural networks](https://stanford.edu/~jlmcc/papers/SaxeMcCGanguli13CogSciProc.pdf)

⏎
- [Stephane Mallat](https://en.wikipedia.org/wiki/St%C3%A9phane_Mallat) awarded Milner RS Prize for [wavelet+RG view](https://arxiv.org/abs/1601.04920)
⏎
⏎
## [Information Bottleneck METHOD](https://knowen-production.s3.amazonaws.com/uploads/attachment/file/1999/The%2BInformation%2BBottleneck%2BMethod%2B-Tishby.pdf)

[Information Bottleneck sheds insight into AI as well as human brain](https://knowen-production.s3.amazonaws.com/uploads/attachment/file/2000/New%2BTheory%2BCracks%2BOpen%2Bthe%2BBlack%2BBox%2Bof%2BDeep%2BLearning%2B-%2BAI%2B-information%2Bbottleneck.pdf)

[Learnability can be undecidable](https://www.nature.com/articles/s42256-018-0002-3)
> We describe simple scenarios where learnability cannot be proved nor refuted using the standard axioms of mathematics. The main idea is to prove an equivalence between learnability and compression.






# Parents

* history and in-depth of AI
Sign in to add a new comment

Contact us or leave feedback

© KTree Inc. 2026