Models, networks and algorithmic complexity
원문 초록
I aim to show that models, classification or generating functions, invariances and datasets are algorithmically equivalent concepts once properly defined, and provide some concrete examples of them. I then show that a) neural networks (NNs) of different kinds can be seen to implement models, b) that perturbations of inputs and nodes in NNs trained to optimally implement simple models propagate strongly, c) that there is a framework in which recurrent, deep and shallow networks can be seen to fall into a descriptive power hierarchy in agreement with notions from the theory of recursive functions. The motivation for these definitions and following analysis lies in the context of cognitive neuroscience, and in particular in Ruffini (2016), where the concept of model is used extensively, as is the concept of algorithmic complexity.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Describe Anything Model for Visual Question Answering on Text-rich Images
Assay2Mol: large language model-based drug design using BioAssay context
Beyond Accuracy: Metrics that Uncover What Makes a 'Good' Visual Descriptor
Dataset Distillation via Vision-Language Category Prototype
DRAMA-X: A Fine-grained Intent Prediction and Risk Reasoning Benchmark For Driving
InstructTTSEval: Benchmarking Complex Natural-Language Instruction Following in Text-to-Speech Systems
토론
이 논문과 연결된 포럼 글이 아직 없습니다.