Student-t processes as alternatives to Gaussian processes

We investigate the Student-t process as an alternative to the Gaussian process as a non-parametric prior over functions. We derive closed form expressions for the marginal likelihood and predictive distribution of a Student-t process, by integrating away an inverse Wishart process prior over the co-variance kernel of a Gaussian process model. We show surprising equivalences between different hierarchical Gaussian process models leading to Student-t processes, and derive a new sampling scheme for the inverse Wishart process, which helps elucidate these equivalences. Overall, we show that a Student-t process can retain the attractive properties of a Gaussian process - a nonparamet-ric representation, analytic marginal and predictive distributions, and easy model selection through covariance kernels - but has enhanced flexibility, and predictive covariances that, unlike a Gaussian process, explicitly depend on the values of training observations. We verify empirically that a Student-t process is especially useful in situations where there are changes in covariance structure, or in applications such as Bayesian optimization, where accurate predictive covariances are critical for good performance. These advantages come at no additional computational cost over Gaussian processes.

Evaluation of the functionality of biodegradable polymeric platforms for drug delivery systems

We present the development of a drug-loaded triple-layer platform consisting of thin film biodegradable polymers, in a properly designed form for the desired gradual degradation. Poly(dl-lactide-co-glycolide) (PLGA (65:35), PLGA (75:25)) and polycaprolactone (PCL) were grown by spin coating technique, to synthesize the platforms with the order PCL/PLGA (75:25)/PLGA (65:35) that determine their degradation rates. The outer PLGA (65:35) layer was loaded with dipyridamole, an antiplatelet drug. Spectroscopic ellipsometry (SE) in the Vis-far UV range was used to determine the nanostructure, as well as the content of the incorporated drug in the as-grown platforms. In situ and real-time SE measurements were carried out using a liquid cell for the dynamic evaluation of the fibrinogen and albumin protein adsorption processes. Atomic force microscopy studies justified the SE results concerning the nanopores formation in the polymeric platforms, and the dominant adsorption mechanisms of the proteins, which were defined by the drug incorporation in the platforms. © 2013 Elsevier B.V. All rights reserved.

Fault tolerant control using Gaussian processes and model predictive control

Essential ingredients for fault-tolerant control are the ability to represent system behaviour following the occurrence of a fault, and the ability to exploit this representation for deciding control actions. Gaussian processes seem to be very promising candidates for the first of these, and model predictive control has a proven capability for the second. We therefore propose to use the two together to obtain fault-tolerant control functionality. Our proposal is illustrated by several reasonably realistic examples drawn from flight control. © 2013 IEEE.

Gaussian processes for POMDP-based dialogue manager optimization

A partially observable Markov decision process (POMDP) has been proposed as a dialog model that enables automatic optimization of the dialog policy and provides robustness to speech understanding errors. Various approximations allow such a model to be used for building real-world dialog systems. However, they require a large number of dialogs to train the dialog policy and hence they typically rely on the availability of a user simulator. They also require significant designer effort to hand-craft the policy representation. We investigate the use of Gaussian processes (GPs) in policy modeling to overcome these problems. We show that GP policy optimization can be implemented for a real world POMDP dialog manager, and in particular: 1) we examine different formulations of a GP policy to minimize variability in the learning process; 2) we find that the use of GP increases the learning rate by an order of magnitude thereby allowing learning by direct interaction with human users; and 3) we demonstrate that designer effort can be substantially reduced by basing the policy directly on the full belief space thereby avoiding ad hoc feature space modeling. Overall, the GP approach represents an important step forward towards fully automatic dialog policy optimization in real world systems. © 2013 IEEE.

Characterizing the class of local metal sheet thickening processes

The need to create high-value products for specialist applications, and the search for efficient forming routes that obviate the need for some machining steps, is driving Interest In a novel class of forming processes aiming to create locally thickened features within sheet work- pieces. A number of novel forming processes have been proposed to meet this need, but it is as yet unclear which processes will be most effective in creating local thickening of various geometries, and many process configurations have yet to be tried. This paper aims to provide some basic principles for designing and characterising process behaviour. A simplified generic description of sheet thickening processes is provided, with two tools of variable operating on a sheet workpiece in plane strain, with different tool separations and motions parameterised. A comprehensive numerical study of the behaviour of this class of processes is conducted in Abaqus to predict the main characteristics of the material flow in each configuration. The results are used to classify the different basic behaviours that can be achieved by the sheet-bulk thickening processes and to give guidance on future process development, capability and applicability. © 2011 Wiley-VCH Verlag GmbH & Co. KGaA. Weinheim.

Classification using log Gaussian Cox processes

McCullagh and Yang (2006) suggest a family of classification algorithms based on Cox processes. We further investigate the log Gaussian variant which has a number of appealing properties. Conditioned on the covariates, the distribution over labels is given by a type of conditional Markov random field. In the supervised case, computation of the predictive probability of a single test point scales linearly with the number of training points and the multiclass generalization is straightforward. We show new links between the supervised method and classical nonparametric methods. We give a detailed analysis of the pairwise graph representable Markov random field, which we use to extend the model to semi-supervised learning problems, and propose an inference method based on graph min-cuts. We give the first experimental analysis on supervised and semi-supervised datasets and show good empirical performance.