approxim
A Foundation to Perception Computing, Logic and Automata
In this report, a novel approach to intelligence and learning is introduced; this approach is based upon what we called percep tion logic. W h at we call ' perception automata ' is introduced in which learning is accom p lished at different perception resolution. Learning in this autom a ta is not heuristic, rather it guarantees the convergence of the approxim a ted function to whatever precision required. Furthe rm ore, the learning process can take place on-line and in at m o st O(log(N)) epochs, where N is the num ber of sam p les. The perception autom a ta is based on hierarchal leve ls of resolution in which each level adds som e details to the constructed function till th e final level can successfully reconstruct the whole function. This approach com b ines the favors of com putational approach in the sense that it is precise, structural and rigorous, and the features of distributed processing and adaptivity of soft com puting, as well as continuity and real-tim e response of dynam i cal system s.
Instantaneously Trained Neural Networks
Instantaneously Trained Neural Networks Abhilash Ponnath Abstract: This paper presents a review of instantaneously trained neural networks (ITNNs). These networks trade learning time for size and, in the basic model, a new hidden node is created for each training sample. Various versions of the corner-classification family of ITNNs, which have f ound applications in artificial intelligence (AI), are described. Implementation issues are also considered. 1 Introduction The human brain, the most complex known living structure in the universe, has the nerve cell or neuron as its fundamental unit. The number of neurons and connections between the neurons is enormous; this ensemble enables the brain to surpass the computational capacity of supercomputers in existence today. Artificial neural networks (ANNs) are models of the brain, which implement the mapping, ƒ: X Y such that the task is completed in a "certain" sense.