Foundations of Artificial Intelligence Frameworks: Notion and Limits of AGI
Not on the map. Why?
Abstract (arXiv)
Within the limited scope of this paper, we argue that artificial general intelligence cannot emerge from current neural network paradigms regardless of scale, nor is such an approach healthy for the field at present. Drawing on various notions, discussions, present-day developments and observations, current debates and critiques, experiments, and so on in between philosophy, including the Chinese Room Argument and G"odelian argument, neuroscientific ideas, computer science, the theoretical consideration of artificial intelligence, and learning theory, we address conceptually that neural networks are architecturally insufficient for genuine understanding. They operate as static function approximators of a limited encoding framework - a 'sophisticated sponge' exhibiting complex behaviours without structural richness that constitute intelligence. We critique the theoretical foundations the field relies on and created of recent times; for example, an interesting heuristic as neural scaling law (as an example, arXiv:2001.08361 ) made prominent in a wrong way of interpretation, The Universal Approximation Theorem addresses the wrong level of abstraction and, in parts, partially, the question of current architectures lacking dynamic restructuring capabilities. We propose a framework distinguishing existential facilities (computational substrate) from architectural organization (interpretive structures), and outline principles for what genuine machine intelligence would require, and furthermore, a conceptual method of structuralizing the richer framework on which the principle of neural network system takes hold.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 84 of its 256 references that are in the map. First posted on arXiv 23 Nov 2025.
Builds on
84 of 256 references.
References · 84
- 2017Attention Is All You Needcited by 60,361
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2022Training language models to follow instructions with human feedbackcited by 15,971
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,330
- 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,326
38 more
- 2013Intriguing properties of neural networkscited by 5,155
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2014Neural Machine Translation by Jointly Learning to Align and Translatecited by 4,548
- 2014Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translationcited by 4,057
- 2018Neural Ordinary Differential Equationscited by 3,779
- 2022Instant Neural Graphics Primitives with a Multiresolution Hash Encodingcited by 3,723
- 2022Constitutional AI: Harmlessness from AI Feedbackcited by 3,050
- 2022Training Compute-Optimal Large Language Modelscited by 3,019
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,998
- 2014Sequence to Sequence Learning with Neural Networkscited by 2,986
- 2023A Survey of Large Language Modelscited by 2,576
- 2014Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modelingcited by 2,367
- 2016Understanding deep learning requires rethinking generalizationcited by 1,674
- 2017Towards A Rigorous Science of Interpretable Machine Learningcited by 1,416
- 2023PaLM 2 Technical Reportcited by 1,162
- 2015Effective Approaches to Attention-based Neural Machine Translationcited by 1,026
- 2017A Closer Look at Memorization in Deep Networkscited by 942
- 2019Aleatoric and Epistemic Uncertainty in Machine Learning: An Introduction to Concepts and Methodscited by 913
- 2016The Mythos of Model Interpretabilitycited by 721
- 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 672
- 2020On the Bottleneck of Graph Neural Networks and its Practical Implicationscited by 631
- 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 629
- 2024GSM-Symbolic: Understanding the Limitations of Mathematical Reasoning in Large Language Modelscited by 550
- 2022Beyond neural scaling laws: beating power law scaling via data pruningcited by 528
- 2024Large Language Models: A Surveycited by 525
- 2019Provably Powerful Graph Networkscited by 389
- 2021Explaining Neural Scaling Lawscited by 363
- 2016Benefits of depth in neural networkscited by 250
- 2015A Critical Review of Recurrent Neural Networks for Sequence Learningcited by 224
- 2020How Neural Networks Extrapolate: From Feedforward to Graph Neural Networkscited by 222
- 2015Coordinate Descent Algorithmscited by 219
- 2018Deep Learning: A Critical Appraisalcited by 217
- 2015The Power of Depth for Feedforward Neural Networkscited by 183
- 2025AI Agents vs. Agentic AI: A Conceptual Taxonomy, Applications and Challengescited by 169
- 2016Long Short-Term Memory-Networks for Machine Readingcited by 161
- 2018On the Practical Computational Power of Finite Precision RNNs for Language Recognitioncited by 117
- 2018Troubling Trends in Machine Learning Scholarshipcited by 108
- 2017Latent Dirichlet Allocation (LDA) and Topic modeling: models, applications, a surveycited by 91
50 most cited of 84 All 84 (JSON)
Built on by
Not cited yet.