the achilles point of general ai: the symbol learning problem · 2013. 9. 15. · –symbol...
TRANSCRIPT
![Page 1: The Achilles point of general AI: The symbol learning problem · 2013. 9. 15. · –symbol learning should be possible in polynomial time AGI (even) for extreme graphs: –Symbol](https://reader035.vdocuments.net/reader035/viewer/2022071100/5fd97624500e945c2c11db58/html5/thumbnails/1.jpg)
The Achilles point of general AI: The symbol learning problem
András LőrinczEötvös University
Budapest, Hungary
http://nipg.inf.elte.hu
Faculty of Informatics
Eötvös Loránd University
![Page 2: The Achilles point of general AI: The symbol learning problem · 2013. 9. 15. · –symbol learning should be possible in polynomial time AGI (even) for extreme graphs: –Symbol](https://reader035.vdocuments.net/reader035/viewer/2022071100/5fd97624500e945c2c11db58/html5/thumbnails/2.jpg)
Artificial General Intelligence
• GOFAI:
– There are symbols
– we just have to ground them
– symbol grounding problem
EuCogII Andras Lorincz -- nipg.inf.elte.hut
![Page 3: The Achilles point of general AI: The symbol learning problem · 2013. 9. 15. · –symbol learning should be possible in polynomial time AGI (even) for extreme graphs: –Symbol](https://reader035.vdocuments.net/reader035/viewer/2022071100/5fd97624500e945c2c11db58/html5/thumbnails/3.jpg)
Artificial General Intelligence
• GOFAI:
– There are symbols
– we just have to ground them
– symbol grounding problem – exponentially hard
EuCogII Andras Lorincz -- nipg.inf.elte.hut
![Page 4: The Achilles point of general AI: The symbol learning problem · 2013. 9. 15. · –symbol learning should be possible in polynomial time AGI (even) for extreme graphs: –Symbol](https://reader035.vdocuments.net/reader035/viewer/2022071100/5fd97624500e945c2c11db58/html5/thumbnails/4.jpg)
From Compressive Sampling to the ‘Symbol Learning Problem’Lőrincz 2009
A different view
Constraints
from neuro
from math
EuCogII Andras Lorincz -- nipg.inf.elte.hut
![Page 5: The Achilles point of general AI: The symbol learning problem · 2013. 9. 15. · –symbol learning should be possible in polynomial time AGI (even) for extreme graphs: –Symbol](https://reader035.vdocuments.net/reader035/viewer/2022071100/5fd97624500e945c2c11db58/html5/thumbnails/5.jpg)
From Compressive Sampling to the ‘Symbol Learning Problem’Lőrincz 2009
A different view
Constraints
from neuro
from math
EuCogII Andras Lorincz -- nipg.inf.elte.hut
![Page 6: The Achilles point of general AI: The symbol learning problem · 2013. 9. 15. · –symbol learning should be possible in polynomial time AGI (even) for extreme graphs: –Symbol](https://reader035.vdocuments.net/reader035/viewer/2022071100/5fd97624500e945c2c11db58/html5/thumbnails/6.jpg)
Artificial General Intelligence
• GOFAI:
– There are symbols
– we just have to ground them
– symbol grounding problem – exponentially hard
• Conjecture for AGI:
symbol learning = graph partitioning
EuCogII Andras Lorincz -- nipg.inf.elte.hut
![Page 7: The Achilles point of general AI: The symbol learning problem · 2013. 9. 15. · –symbol learning should be possible in polynomial time AGI (even) for extreme graphs: –Symbol](https://reader035.vdocuments.net/reader035/viewer/2022071100/5fd97624500e945c2c11db58/html5/thumbnails/7.jpg)
• The main concern– if there are low entropy variables (symbols) such that
– the transition probabilities (weights of the graph) between the low entropy variables determine
– the transition probabilities between the high entropy manifestations or not and
• Whether the low entropy variables can be learned in polynomial time.
• Recent mathematical advances claim– even for extreme graphs
– symbol learning should be possible in polynomial time
Do symbols exist?
EuCogII Andras Lorincz -- nipg.inf.elte.hut
![Page 8: The Achilles point of general AI: The symbol learning problem · 2013. 9. 15. · –symbol learning should be possible in polynomial time AGI (even) for extreme graphs: –Symbol](https://reader035.vdocuments.net/reader035/viewer/2022071100/5fd97624500e945c2c11db58/html5/thumbnails/8.jpg)
• The main concern– if there are low entropy variables (symbols) such that
– the transition probabilities (weights of the graph) between the low entropy variables determine
– the transition probabilities between the high entropy manifestations or not and
• Whether the low entropy variables can be learned in polynomial time.
• Recent mathematical advances claim– even for extreme graphs
– symbol learning should be possible in polynomial time
Do symbols exist?
EuCogII Andras Lorincz -- nipg.inf.elte.hut
![Page 9: The Achilles point of general AI: The symbol learning problem · 2013. 9. 15. · –symbol learning should be possible in polynomial time AGI (even) for extreme graphs: –Symbol](https://reader035.vdocuments.net/reader035/viewer/2022071100/5fd97624500e945c2c11db58/html5/thumbnails/9.jpg)
• The main concern– if there are low entropy variables (symbols) such that
– the transition probabilities (weights of the graph) between the low entropy variables determine
– the transition probabilities between the high entropy manifestations or not and
• Whether the low entropy variables can be learned in polynomial time.
• Recent mathematical advances claim– even for extreme graphs
– symbol learning should be possible in polynomial time
Do symbols exist?
EuCogII Andras Lorincz -- nipg.inf.elte.hut
![Page 10: The Achilles point of general AI: The symbol learning problem · 2013. 9. 15. · –symbol learning should be possible in polynomial time AGI (even) for extreme graphs: –Symbol](https://reader035.vdocuments.net/reader035/viewer/2022071100/5fd97624500e945c2c11db58/html5/thumbnails/10.jpg)
• The main concern– if there are low entropy variables (symbols) such that
– the transition probabilities (weights of the graph) between the low entropy variables determine
– the transition probabilities between the high entropy manifestations or not and
• Whether the low entropy variables can be learned in polynomial time.
• Recent mathematical advances claim– even for extreme graphs
– symbol learning should be possible in polynomial time
Do symbols exist?
EuCogII Andras Lorincz -- nipg.inf.elte.hut
![Page 11: The Achilles point of general AI: The symbol learning problem · 2013. 9. 15. · –symbol learning should be possible in polynomial time AGI (even) for extreme graphs: –Symbol](https://reader035.vdocuments.net/reader035/viewer/2022071100/5fd97624500e945c2c11db58/html5/thumbnails/11.jpg)
• The main concern– if there are low entropy variables (symbols) such that
– the transition probabilities (weights of the graph) between the low entropy variables determine
– the transition probabilities between the high entropy manifestations or not
• Whether the low entropy variables can be learned in polynomial time.
• Recent mathematical advances claim– even for extreme graphs
– symbol learning should be possible in polynomial time
Do symbols exist?
EuCogII Andras Lorincz -- nipg.inf.elte.hut
![Page 12: The Achilles point of general AI: The symbol learning problem · 2013. 9. 15. · –symbol learning should be possible in polynomial time AGI (even) for extreme graphs: –Symbol](https://reader035.vdocuments.net/reader035/viewer/2022071100/5fd97624500e945c2c11db58/html5/thumbnails/12.jpg)
• The main concern– if there are low entropy variables (symbols) such that
– the transition probabilities (weights of the graph) between the low entropy variables determine
– the transition probabilities between the high entropy manifestations or not and
• Whether the low entropy variables can be learned in polynomial time.
• Recent mathematical advances claim– even for extreme graphs
– symbol learning should be possible in polynomial time
Do symbols exist?
EuCogII Andras Lorincz -- nipg.inf.elte.hut
![Page 13: The Achilles point of general AI: The symbol learning problem · 2013. 9. 15. · –symbol learning should be possible in polynomial time AGI (even) for extreme graphs: –Symbol](https://reader035.vdocuments.net/reader035/viewer/2022071100/5fd97624500e945c2c11db58/html5/thumbnails/13.jpg)
• The main concern– if there are low entropy variables (symbols) such that
– the transition probabilities (weights of the graph) between the low entropy variables determine
– the transition probabilities between the high entropy manifestations or not and
• Whether the low entropy variables can be learned in polynomial time.
• Recent mathematical advances claim– even for extreme graphs
– symbol learning should be possible in polynomial time
Do symbols exist?
EuCogII Andras Lorincz -- nipg.inf.elte.hut
![Page 14: The Achilles point of general AI: The symbol learning problem · 2013. 9. 15. · –symbol learning should be possible in polynomial time AGI (even) for extreme graphs: –Symbol](https://reader035.vdocuments.net/reader035/viewer/2022071100/5fd97624500e945c2c11db58/html5/thumbnails/14.jpg)
• The main concern– if there are low entropy variables (symbols) such that
– the transition probabilities (weights of the graph) between the low entropy variables determine
– the transition probabilities between the high entropy manifestations or not and
• Whether the low entropy variables can be learned in polynomial time.
• Recent mathematical advances claim– even for extreme graphs
– symbol learning should be possible in polynomial time
Do symbols exist?
EuCogII Andras Lorincz -- nipg.inf.elte.hut
![Page 15: The Achilles point of general AI: The symbol learning problem · 2013. 9. 15. · –symbol learning should be possible in polynomial time AGI (even) for extreme graphs: –Symbol](https://reader035.vdocuments.net/reader035/viewer/2022071100/5fd97624500e945c2c11db58/html5/thumbnails/15.jpg)
Recent mathematical advances claim
– even for extreme graphs
– symbol learning should be possible in polynomial time
AGI (even) for extreme graphs:
– Symbol learning separation of structure and noise
– Separation of structure and noise in extreme graphs
Terrence Tao
Symbol learning
EuCogII Andras Lorincz -- nipg.inf.elte.hut
![Page 16: The Achilles point of general AI: The symbol learning problem · 2013. 9. 15. · –symbol learning should be possible in polynomial time AGI (even) for extreme graphs: –Symbol](https://reader035.vdocuments.net/reader035/viewer/2022071100/5fd97624500e945c2c11db58/html5/thumbnails/16.jpg)
References
A. Lőrincz – about the architecture
Learning and Representation:
From Compressive Sampling to the “Symbol Learning Problem”
In.: Handbook of Large-Scale Random Networks, Springer 2009
T. Tao – the focal point of structure-noise separateion
Szemerédi's regularity lemma revisited
Contributions to Discrete Mathematics, 1: 8-28, (2006)
EuCogII Andras Lorincz -- nipg.inf.elte.hut
![Page 17: The Achilles point of general AI: The symbol learning problem · 2013. 9. 15. · –symbol learning should be possible in polynomial time AGI (even) for extreme graphs: –Symbol](https://reader035.vdocuments.net/reader035/viewer/2022071100/5fd97624500e945c2c11db58/html5/thumbnails/17.jpg)
Thanks for your attention
András LőrinczEötvös University
Budapest, Hungary
http://nipg.inf.elte.hu
Faculty of Informatics
Eötvös Loránd University