Europe
Dynamics of Generalization in Linear Perceptrons
We study the evolution of the generalization ability of a simple linear perceptron withN inputs which learns to imitate a "teacher perceptron". The system is trained on p aN binary example inputs and the generalization abilitymeasured by testing for agreement with the teacher on all 2N possible binary input patterns. The dynamics may be solved analytically and exhibits a phase transition from imperfect to perfect generalization at a 1. Except at this point the generalization ability approaches its asymptotic value exponentially, with critical slowing down near the transition; therelaxation time is ex (1 - y'a)-2.
Navigating through Temporal Difference
Barto, Sutton and Watkins [2] introduced a grid task as a didactic example oftemporal difference planning and asynchronous dynamical pre gramming. Thispaper considers the effects of changing the coding of the input stimulus, and demonstrates that the self-supervised learning of a particular form of hidden unit representation improves performance.
A Novel Approach to Prediction of the 3-Dimensional Structures of Protein Backbones by Neural Networks
Fredholm, Henrik, Bohr, Henrik, Bohr, Jakob, Brunak, Sรธren, Cotterill, Rodney M. J., Lautrup, Benny, Petersen, Steffen B.
One current aim of molecular biology is determination of the (3D) tertiary structures ofproteins in their folded native state from their sequences of amino acid 523 524 Fredholm, Bohr, Bohr, Brunak, Cotterill, Lautrup, and Thtersen residues. Since Kendrew & Perutz solved the first protein structures, myoglobin and hemoglobin, and explained from the discovered structures how these proteins perform their function, it has been widely recognized that protein function is intimately linkedwith protein structure[l]. Within the last two decades X-ray crystallographers have solved the 3-dimensional (3D) structures of a steadily increasing number of proteins in the crystalline state, and recently 2D-NMR spectroscopy has emerged as an alternative method for small proteins in solution. Today approximately three hundred 3D structures have been solved by these methods, although only about half of them can be considered as truly different, and only around a hundred of them are solved at high resolution (that is, less than 2A). The number of protein sequences known today is well over 20,000, and this number seems to be growing at least one order of magnitude faster than the number of known 3D protein structures. Obviously, it is of great importance to develop tools that can predict structural aspects of proteins on the basis of knowledge acquired from known 3D structures.
ART2/BP architecture for adaptive estimation of dynamic processes
The goal has been to construct a supervised artificial neural network that learns incrementally an unknown mapping. As a result a network consisting ofa combination of ART2 and backpropagation is proposed and is called an "ART2/BP" network. The ART2 network is used to build and focus a supervised backpropagation network. The ART2/BP network has the advantage of being able to dynamically expand itself in response to input patterns containing new information. Simulation results show that the ART2/BP network outperforms a classical maximum likelihood method for the estimation of a discrete dynamic and nonlinear transfer function.
Speech Recognition Using Connectionist Approaches
This paper is a summary of SPRINT project aims and results. The project focus on the use of neuro-computing techniques to tackle various problems that remain unsolved in speech recognition. First results concern the use of feedforward netsfor phonetic units classification, isolated word recognition, and speaker adaptation.
Principles of Diagnosis: Current Trends and a Report on the First International Workshop
Automated diagnosis is an important AI problem not only for its potential practical applications but also because it exposes issues common to all automated reasoning efforts and presents real challenges to existing paradigms. Current research in this area addresses many problems, including managing and structuring probabilistic information, modeling physical systems, reasoning with defeasible assumptions, and interleaving deliberation and action. Furthermore, diagnosis programs must face these problems in contexts where scaling up to deal with cases of realistic size results in daunting combinatorics. This article presents these and other issues as discussed at the First International Workshop on Principles of Diagnosis.
The Cognitive Structure of Emotions: A Review
Each of the The second volume promises to inherent to the task of specifying objections is then analyzed from a draw on a characterization of AI's the deterministic or nondeterministic formal standpoint because the relevant essential methodology as continuous machine, and complexity of electric elements of formal theory are attempts to overcome the formal or logical circuits), physical limits of introduced in subsequent chapters. I hope to see my (that is, finite, discrete concepts can Lovelace's objection. Despite the criticisms dissipate after reading the never form a perfect model of a continuous introductory character of the chapter, second volume. Let's get a feeling of what this first and possible-world semantics. With volume is really about.
Decision Analysis and Expert Systems
Henrion, Max, Breese, John S., Horvitz, Eric J.
Decision analysis and expert systems are technologies intended to support human reasoning and decision making by formalizing expert knowledge so that it is amenable to mechanized reasoning methods. Despite some common goals, these two paradigms have evolved divergently, with fundamental differences in principle and practice. Recent recognition of the deficiencies of traditional AI techniques for treating uncertainty, coupled with the development of belief nets and influence diagrams, is stimulating renewed enthusiasm among AI researchers in probabilistic reasoning and decision analysis. We present the key ideas of decision analysis and review recent research and applications that aim toward a marriage of these two paradigms. This work combines decision-analytic methods for structuring and encoding uncertain knowledge and preferences with computational techniques from AI for knowledge representation, inference, and explanation. We end by outlining remaining research issues to fully develop the potential of this enterprise.
Intentions in Communication: A Review
Bratman's definition of intention is papers range from philosophical This review is organized around the jumping-off point for Cohen and analyses of the concept of intention three of the themes that are sounded Levesque's two papers: "Persistence, to algorithms for recognizing plans, in Intentions in Communication: (1) Intention, and Commitment" and from logical formalizations of speech foundational work on intention and "Rational Interaction as the Basis of acts to analyses of intonational contours its relation to speech act theory, (2) Communication."