Although one can derive the Gaussian noise assumption based on a maximum entropy approach, the main reason for this assumption is practicability: under the Gaussian noise assumption the maximum likelihood parameter estimate can simply be found by minimization of the squared error. Despite its common use it is far from clear that the Gaussian noise assumption is a good choice for many practical problems. A reasonable approach therefore would be a noise distribution which contains the Gaussian as a special case but which has a tunable parameter that allows for more flexible distributions.

An important issue in neural computing concerns the description of learning dynamics with macroscopic dynamical variables. Recent progress on online learning only addresses the often unrealistic case of an infinite training set. We introduce a new framework to model batch learning of restricted sets of examples, widely applicable to any learning cost function, and fully taking into account the temporal correlations introduced by the recycling of the examples. For illustration we analyze the effects of weight decay and early stopping during the learning of teacher-generated examples.

Stochastic meta-descent (SMD) is a new technique for online adaptation oflocal learning rates in arbitrary twice-differentiable systems. Like matrix momentum it uses full second-order information while retaining O(n) computational complexity by exploiting the efficient computation of Hessian-vector products. Here we apply SMD to independent component analysis, and employ the resulting algorithmfor the blind separation of time-varying mixtures. By matching individual learning rates to the rate of change in each source signal's mixture coefficients, our technique is capable of simultaneously trackingsources that move at very different, a priori unknown speeds. 1 Introduction Independent component analysis (ICA) methods are typically run in batch mode in order to keep the stochasticity of the empirical gradient low. Often this is combined with a global learning rate annealing scheme that negotiates the tradeoff between fast convergence and good asymptotic performance.

We present a variational Bayesian method for model selection over families of kernels classifiers like Support Vector machines or Gaussian processes.The algorithm needs no user interaction and is able to adapt a large number of kernel parameters to given data without having to sacrifice training cases for validation. This opens the possibility touse sophisticated families of kernels in situations where the small "standard kernel" classes are clearly inappropriate. We relate the method to other work done on Gaussian processes and clarify the relation between Support Vector machines and certain Gaussian process models. 1 Introduction Bayesian techniques have been widely and successfully used in the neural networks and statistics community and are appealing because of their conceptual simplicity, generality and consistency with which they solve learning problems. In this paper we present a new method for applying the Bayesian methodology to Support Vector machines. We will briefly review Gaussian Process and Support Vector classification in this section and clarify their relationship by pointing out the common roots. Although we focus on classification here, it is straightforward to apply the methods to regression problems as well. In section 2 we introduce our algorithm and show relations to existing methods. Finally, we present experimental results in section 3 and close with a discussion in section 4. Let X be a measure space (e.g.

Although one can derive the Gaussian noise assumption based on a maximum entropy approach, the main reason for this assumption is practicability: underthe Gaussian noise assumption the maximum likelihood parameter estimate can simply be found by minimization of the squared error. Despite its common use it is far from clear that the Gaussian noise assumption is a good choice for many practical problems. Areasonable approach therefore would be a noise distribution which contains the Gaussian as a special case but which has a tunable parameter that allows for more flexible distributions.

An important issue in neural computing concerns the description of learning dynamics with macroscopic dynamical variables. Recent progresson online learning only addresses the often unrealistic case of an infinite training set. We introduce a new framework to model batch learning of restricted sets of examples, widely applicable toany learning cost function, and fully taking into account the temporal correlations introduced by the recycling of the examples. For illustration we analyze the effects of weight decay and early stopping during the learning of teacher-generated examples.

Enabling organizations to capture, share, and apply the collective experience and know-how of their people is seen as fundamental to competing in the knowledge economy. As a result, there has been a wave of enthusiasm and activity centered on knowledge management. To make progress in this area, issues of technology, process, people, and content must be addressed. In this article, we develop a road map for knowledge management. It begins with an assessment of the current state of the practice, using examples drawn from our experience at Schlumberger. It then sketches the possible evolution of technology and practice over a 10-year period. Along the way, we highlight ways in which AI technology, present and future, can be applied in knowledge management systems.

The researcher will be numerous international societies and IJCAI-01/IJCAI-03 Update. Planning required to sign a statement of restricted conferences. Barbara Grosz agreed to for IJCAI-01 is well under way.

Carnegie Mellon University and then continued investigating issues in representation and reasoning as part of his research career for the last decade and a half. However, the engineers, as is their wont, have their own take and emphasis many faces: Its philosophical progress, instigated by the focus on on AI issues. Teaching engineering and animals, and its mathematical list gives some idea about how students interested in AI, especially face to formulating and analyzing concerns with application bring advances when they are taking courses along classes of algorithms that appear to be in theory, as has happened earlier with computer science students, presents effective in providing computers with in mathematics and physics. Many academic researchers have the difference in background and interest. For several decades, there has found that AI often elicits greater interest Also, when ideas are presented been another face to the field, a technological from fellow academics in engineering somewhat abstractly, the engineering one that provides tools for departments--many computer students might need to do extra work solving practical problems in various science departments are housed in in seeing how they might be applied domains. AI It would thus be great if there interaction with AI.

In science, business, and policymaking--anywhere data are used in prediction--two sorts of problems requiring very different methods of analysis often arise. The first, problems of recognition and classification, concerns learning how to use some features of a system to accurately predict other features of that system. The second, problems of causal discovery, concerns learning how to predict those changes to some features of a system that will result if an intervention changes other features. This book is about the second--much more difficult--type of problem. The contributors discuss recent research and applications using Bayes nets or directed graphic representations, including representations of feedback or "recursive" systems. The book contains a thorough discussion of foundational issues, algorithms, proof techniques, and applications to economics, physics, biology, educational research, and other areas. ISBN 0-262-57124-2 426 pp., bibliography, index Published by AAAI Press - http://www.aaai.org/Press/