Goto

Collaborating Authors

 Industry


Woody Bledsoe: His Life and Legacy

AI Magazine

(Bledsoe 1976). We didn't know we were being We spent a lot of time reading by ourselves, because most of the time the other grades were having their classes. But we DID learn, and had some pretty died on 4 October 1995 of ALS, good teachers (Bledsoe 1976). Woody was one of the and recalls spending "hours just roaming founders of AI, making early contributions in around, sometimes working mathematics pattern recognition and automated reasoning. He continued to make significant contributions When Woody was 12, his father died. It was to AI throughout his long career. His a devastating blow both emotionally and legacy consists not only of his scientific work financially. As Woody recalled, "We were poor but also of several generations of scientists before, but after papa died in January 1934, who learned from Woody the joy of scientific things got worse" (Bledsoe 1976). He and the research and the way to go about it. Woody's rest of his brothers and sisters worked dreary enthusiasm, his perpetual sense of optimism, 10-hour days to make ends meet. He to humanity offered those who knew him the found work in north Texas driving a tractor all hope and comfort that truly good and great night. After a month, he hopped a freight men do exist. He graduated little farm near Maysville, Oklahoma. He moved to Oklahoma to try his took a job as a dishwasher, working 12-hour luck at farming. Woody was the fourth child days 7 days a week. In for his heroic activities in arranging the April, the restaurant owner forced him back transportation of troops across the Rhine into working 12-hour days, which was too in March, 1945. He left the Rhine bridges except the one at Remagen university without saying goodbye and had been destroyed by the retreating German joined the United States Army. Patton's Third Army decided to cross the Rhine by boats near Frankfurt rather than suffer the delay of waiting for bridge construction. Therefore the went to Officer's Candidate School (OCS) Army Corps of Engineers hauled naval By the time he in 1942, he had been promoted to second landing craft (designed for beach landings) lieutenant. While at OCS, Woody had an by truck across Europe to ferry experience that had a profound effect on him: troops across the Rhine. Bledsoe, by then an Army captain, recalls that there was Another experience at OCS at Fort only light enemy fire during the crossing; Belvoir left a lasting impression on me. His first "research" was experimenting army truck. The simple idea opened the flap and said, "Get out here. of backing the trucks into the water, Let's do the map reading." He would later father a to get on with the work, to finish the son, Greg, born in March 1947. It taught me that "if we have to had two more children, Pam and Lance.


Improved Use of Continuous Attributes in C4.5

Journal of Artificial Intelligence Research

A reported weakness of C4.5 in domains with continuous attributes is addressed by modifying the formation and evaluation of tests on continuous attributes. An MDL-inspired penalty is applied to such tests, eliminating some of them from consideration and altering the relative desirability of all tests. Empirical trials show that the modifications lead to smaller decision trees with higher predictive accuracies. Results also confirm that a new version of C4.5 incorporating these changes is superior to recent approaches that use global discretization and that construct small trees with multi-interval splits.


Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences

Journal of Artificial Intelligence Research

The paper describes an extension of well-founded semantics for logic programs with two types of negation. In this extension information about preferences between rules can be expressed in the logical language and derived dynamically. This is achieved by using a reserved predicate symbol and a naming technique. Conflicts among rules are resolved whenever possible on the basis of derived preference information. The well-founded conclusions of prioritized logic programs can be computed in polynomial time. A legal reasoning example illustrates the usefulness of the approach.


Logarithmic-Time Updates and Queries in Probabilistic Networks

Journal of Artificial Intelligence Research

Traditional databases commonly support efficient query and update procedures that operate in time which is sublinear in the size of the database. Our goal in this paper is to take a first step toward dynamic reasoning in probabilistic databases with comparable efficiency. We propose a dynamic data structure that supports efficient algorithms for updating and querying singly connected Bayesian networks. In the conventional algorithm, new evidence is absorbed in O(1) time and queries are processed in time O(N), where N is the size of the network. We propose an algorithm which, after a preprocessing phase, allows us to answer queries in time O(log N) at the expense of O(log N) time per evidence absorption. The usefulness of sub-linear processing time manifests itself in applications requiring (near) real-time response over large probabilistic databases. We briefly discuss a potential application of dynamic probabilistic reasoning in computational biology.


A Silicon Axon

Neural Information Processing Systems

It is well known that axons are neural processes specialized for transmitting information over relatively long distances in the nervous system. Impulsive electrical disturbances known as action potentials are normally initiated near the cell body of a neuron when the voltage across the cell membrane crosses a threshold. These pulses are then propagated with a fairly stereotypical shape at a more or less constant velocity down the length of the axon. Consequently, axons excel at precisely preserving the relative timing of threshold crossing events but do not preserve any of the initial signal shape. Information, then, is presumably encoded in the relative timing of action potentials.


Learning to Play the Game of Chess

Neural Information Processing Systems

This paper presents NeuroChess, a program which learns to play chess from the final outcome of games. NeuroChess learns chess board evaluation functions, represented by artificial neural networks.


Correlation and Interpolation Networks for Real-time Expression Analysis/Synthesis

Neural Information Processing Systems

We describe a framework for real-time tracking of facial expressions that uses neurally-inspired correlation and interpolation methods. A distributed view-based representation is used to characterize facial state, and is computed using a replicated correlation network. The ensemble response of the set of view correlation scores is input to a network based interpolation method, which maps perceptual state to motor control states for a simulated 3-D face model. Activation levels of the motor state correspond to muscle activations in an anatomically derived model. By integrating fast and robust 2-D processing with 3-D models, we obtain a system that is able to quickly track and interpret complex facial motions in real-time.


Anatomical origin and computational role of diversity in the response properties of cortical neurons

Neural Information Processing Systems

Our results show that maximal diversity of neuronal response properties is attained when the ratio of dendritic and axonal arbor sizes is equal to 1, a value found in many cortical areas and across species (Lund et al., 1993; Malach, 1994). Maximization of diversity also leads to better performance in systems of receptive fields implementing steerablejshiftable filters, which may be necessary for generating the seemingly continuous range of orientation selectivity found in VI, and in ma.tching spatially distributed signals. This cortical organization principle may, therefore, have the double advantage of accounting for the formation of the cortical columns and the associated patchy projection patterns, and of explaining how systems of receptive fields can support functions such as the generation of precise response tuning from imprecise distributed inputs, and the matching of distributed signals, a problem that arises in visual tasks such as stereopsis, motion processing, and recognition.


Hierarchical Mixtures of Experts Methodology Applied to Continuous Speech Recognition

Neural Information Processing Systems

In this paper, we incorporate the Hierarchical Mixtures of Experts (HME) method of probability estimation, developed by Jordan [1], into an HMMbased continuous speech recognition system. The resulting system can be thought of as a continuous-density HMM system, but instead of using gaussian mixtures, the HME system employs a large set of hierarchically organized but relatively small neural networks to perform the probability density estimation. The hierarchical structure is reminiscent of a decision tree except for two important differences: each "expert" or neural net performs a "soft" decision rather than a hard decision, and, unlike ordinary decision trees, the parameters of all the neural nets in the HME are automatically trainable using the EM algorithm. We report results on the ARPA 5,OOO-word and 4O,OOO-word Wall Street Journal corpus using HME models. 1 Introduction Recent research has shown that a continuous-density HMM (CD-HMM) system can outperform a more constrained tied-mixture HMM system for large-vocabulary continuous speech recognition (CSR) when a large amount of training data is available [2]. In other work, the utility of decision trees has been demonstrated in classification problems by using the "divide and conquer" paradigm effectively, where a problem is divided into a hierarchical set of simpler problems.


Learning Saccadic Eye Movements Using Multiscale Spatial Filters

Neural Information Processing Systems

Such sensors realize the simultaneous need for wide field-of-view and good visual acuity. One popular class of space-variant sensors is formed by log-polar sensors which have a small area near the optical axis of greatly increased resolution (the fovea) coupled with a peripheral region that witnesses a gradual logarithmic falloff in resolution as one moves radially outward. These sensors are inspired by similar structures found in the primate retina where one finds both a peripheral region of gradually decreasing acuity and a circularly symmetric area centmlis characterized by a greater density of receptors and a disproportionate representation in the optic nerve [3]. The peripheral region, though of low visual acuity, is more sensitive to light intensity and movement. The existence of a region optimized for discrimination and recognition surrounded by a region geared towards detection thus allows the image of an object of interest detected in the outer region to be placed on the more analytic center for closer scrutiny. Such a strategy however necessitates the existence of (a) methods to determine which location in the periphery to foveate next, and (b) fast gaze-shifting mechanisms to achieve this 894 Rajesh P. N. Rao, Dana H. Ballard