This text defines a variety of non-Gaussian processes, develops methods for generating realizations of non-Gaussian models, and provides methods for finding probabilistic characteristics of the output of linear filters with non-Gaussian inputs.

A comprehensive and self-contained introduction to Gaussian processes, which provide a principled, practical, probabilistic approach to learning in kernel machines. Gaussian processes (GPs) provide a principled, practical, probabilistic approach to learning in kernel machines. GPs have received increased attention in the machine-learning community over the past decade, and this book provides a long-needed systematic and unified treatment of theoretical and practical aspects of GPs in machine learning. The treatment is comprehensive and self-contained, targeted at researchers and students in machine learning and applied statistics. The book deals with the supervised-learning problem for both regression and classification, and includes detailed algorithms. A wide variety of covariance (kernel) functions are presented and their properties discussed. Model selection is discussed both from a Bayesian and a classical perspective. Many connections to other well-known techniques from machine learning and statistics are discussed, including support-vector machines, neural networks, splines, regularization networks, relevance vector machines and others. Theoretical issues including learning curves and the PAC-Bayesian framework are treated, and several approximation methods for learning with large datasets are discussed. The book contains illustrative examples and exercises, and code and datasets are available on the Web. Appendixes provide mathematical background and a discussion of Gaussian Markov processes.

Gaussian processes can be viewed as a far-reaching infinite-dimensional extension of classical normal random variables. Their theory presents a powerful range of tools for probabilistic modelling in various academic and technical domains such as Statistics, Forecasting, Finance, Information Transmission, Machine Learning - to mention just a few. The objective of these Briefs is to present a quick and condensed treatment of the core theory that a reader must understand in order to make his own independent contributions. The primary intended readership are PhD/Masters students and researchers working in pure or applied mathematics. The first chapters introduce essentials of the classical theory of Gaussian processes and measures with the core notions of reproducing kernel, integral representation, isoperimetric property, large deviation principle. The brevity being a priority for teaching and learning purposes, certain technical details and proofs are omitted. The later chapters touch important recent issues not sufficiently reflected in the literature, such as small deviations, expansions, and quantization of processes. In university teaching, one can build a one-semester advanced course upon these Briefs.​

Proceedings of the June, 1998 conference. Seventy contributions discuss Monte Carlo and signal processing methods, random vibrations, safety and reliability, control/optimization and modeling of nonlinearity, earthquake engineering, random processes and fields, damage/fatigue materials, applied prob

This book was first published in 2006. Written by two of the foremost researchers in the field, this book studies the local times of Markov processes by employing isomorphism theorems that relate them to certain associated Gaussian processes. It builds to this material through self-contained but harmonized 'mini-courses' on the relevant ingredients, which assume only knowledge of measure-theoretic probability. The streamlined selection of topics creates an easy entrance for students and experts in related fields. The book starts by developing the fundamentals of Markov process theory and then of Gaussian process theory, including sample path properties. It then proceeds to more advanced results, bringing the reader to the heart of contemporary research. It presents the remarkable isomorphism theorems of Dynkin and Eisenbaum and then shows how they can be applied to obtain new properties of Markov processes by using well-established techniques in Gaussian process theory. This original, readable book will appeal to both researchers and advanced graduate students.

An overview of the theory and application of kernel classification methods. Linear classifiers in kernel spaces have emerged as a major topic within the field of machine learning. The kernel technique takes the linear classifier—a limited, but well-established and comprehensively studied model—and extends its applicability to a wide range of nonlinear pattern-recognition tasks such as natural language processing, machine vision, and biological sequence analysis. This book provides the first comprehensive overview of both the theory and algorithms of kernel classifiers, including the most recent developments. It begins by describing the major algorithmic advances: kernel perceptron learning, kernel Fisher discriminants, support vector machines, relevance vector machines, Gaussian processes, and Bayes point machines. Then follows a detailed introduction to learning theory, including VC and PAC-Bayesian theory, data-dependent structural risk minimization, and compression bounds. Throughout, the book emphasizes the interaction between theory and algorithms: how learning algorithms work and why. The book includes many examples, complete pseudo code of the algorithms presented, and an extensive source code library.