Hierarchic Bayesian models for kernel learning

The integration of diverse forms of informative data by learning an optimal combination of base kernels in classification or regression problems can provide enhanced performance when compared to that obtained from any single data source. We present a Bayesian hierarchical model which enables kernel learning and present effective variational Bayes estimators for regression and classification. Illustrative experiments demonstrate the utility of the proposed method

Variational Bayesian multinomial probit regression with Gaussian process priors

It is well known in the statistics literature that augmenting binary and polychotomous response models with Gaussian latent variables enables exact Bayesian analysis via Gibbs sampling from the parameter posterior. By adopting such a data augmentation strategy, dispensing with priors over regression coefficients in favour of Gaussian Process (GP) priors over functions, and employing variational approximations to the full posterior we obtain efficient computational methods for Gaussian Process classification in the multi-class setting. The model augmentation with additional latent variables ensures full a posteriori class coupling whilst retaining the simple a priori independent GP covariance structure from which sparse approximations, such as multi-class Informative Vector Machines (IVM), emerge in a very natural and straightforward manner. This is the first time that a fully Variational Bayesian treatment for multi-class GP classification has been developed without having to resort to additional explicit approximations to the non-Gaussian likelihood term. Empirical comparisons with exact analysis via MCMC and Laplace approximations illustrate the utility of the variational approximation as a computationally economic alternative to full MCMC and it is shown to be more accurate than the Laplace approximation

Semi-parametric analysis of multi-rater data

Datasets that are subjectively labeled by a number of experts are becoming more common in tasks such as biological text annotation where class definitions are necessarily somewhat subjective. Standard classification and regression models are not suited to multiple labels and typically a pre-processing step (normally assigning the majority class) is performed. We propose Bayesian models for classification and ordinal regression that naturally incorporate multiple expert opinions in defining predictive distributions. The models make use of Gaussian process priors, resulting in great flexibility and particular suitability to text based problems where the number of covariates can be far greater than the number of data instances. We show that using all labels rather than just the majority improves performance on a recent biological dataset

Optimal control of non-stationary differential linear repetitive processes

Differential repetitive processes are a distinct class of continuousdiscrete 2D linear systems of both systems theoretic and applications interest. The feature which makes them distinct from other classes of such systems is the fact that information propagation in one of the two independent directions only occurs over a finite interval. Applications areas include iterative learning control and iterative solution algorithms for classes of dynamic nonlinear optimal control problems based on the maximum principle, and the modelling of numerous industrial processes such as metal rolling, and long-wall cutting etc. The new results in is paper solve a general optimal problem in the presence of non-stationary dynamics

ODE parameter inference using adaptive gradient matching with Gaussian processes

Parameter inference in mechanistic models based on systems of coupled differential equa- tions is a topical yet computationally chal- lenging problem, due to the need to fol- low each parameter adaptation with a nu- merical integration of the differential equa- tions. Techniques based on gradient match- ing, which aim to minimize the discrepancy between the slope of a data interpolant and the derivatives predicted from the differen- tial equations, offer a computationally ap- pealing shortcut to the inference problem. The present paper discusses a method based on nonparametric Bayesian statistics with Gaussian processes due to Calderhead et al. (2008), and shows how inference in this model can be substantially improved by consistently inferring all parameters from the joint dis- tribution. We demonstrate the efficiency of our adaptive gradient matching technique on three benchmark systems, and perform a de- tailed comparison with the method in Calder- head et al. (2008) and the explicit ODE inte- gration approach, both in terms of parameter inference accuracy and in terms of computa- tional efficiency

The latent process decomposition of cDNA microarray data sets

We present a new computational technique (a software implementation, data sets, and supplementary information are available at http://www.enm.bris.ac.uk/lpd/) which enables the probabilistic analysis of cDNA microarray data and we demonstrate its effectiveness in identifying features of biomedical importance. A hierarchical Bayesian model, called latent process decomposition (LPD), is introduced in which each sample in the data set is represented as a combinatorial mixture over a finite set of latent processes, which are expected to correspond to biological processes. Parameters in the model are estimated using efficient variational methods. This type of probabilistic model is most appropriate for the interpretation of measurement data generated by cDNA microarray technology. For determining informative substructure in such data sets, the proposed model has several important advantages over the standard use of dendrograms. First, the ability to objectively assess the optimal number of sample clusters. Second, the ability to represent samples and gene expression levels using a common set of latent variables (dendrograms cluster samples and gene expression values separately which amounts to two distinct reduced space representations). Third, in contrast to standard cluster models, observations are not assigned to a single cluster and, thus, for example, gene expression levels are modeled via combinations of the latent processes identified by the algorithm. We show this new method compares favorably with alternative cluster analysis methods. To illustrate its potential, we apply the proposed technique to several microarray data sets for cancer. For these data sets it successfully decomposes the data into known subtypes and indicates possible further taxonomic subdivision in addition to highlighting, in a wholly unsupervised manner, the importance of certain genes which are known to be medically significant. To illustrate its wider applicability, we also illustrate its performance on a microarray data set for yeast

Old and New Fields on Super Riemann Surfaces

The ``new fields" or ``superconformal functions" on $N=1$ super Riemann surfaces introduced recently by Rogers and Langer are shown to coincide with the Abelian differentials (plus constants), viewed as a subset of the functions on the associated $N=2$ super Riemann surface. We confirm that, as originally defined, they do not form a super vector space.Comment: 9 pages, LaTex. Published version: minor changes for clarity, two new reference

“I Identify with Her,” “I Identify with Him”: Unpacking the Dynamics of Personal Identification in Organizations

Despite recognizing the importance of personal identification in organizations, researchers have rarely explored its dynamics. We define personal identification as perceived oneness with another individual, where one defines oneself in terms of the other. While many scholars have found that personal identification is associated with helpful effects, others have found it harmful. To resolve this contradiction, we distinguish between three paths to personal identification—threat-focused, opportunity-focused, and closeness-focused paths—and articulate a model that includes each. We examine the contextual features, how individuals’ identities are constructed, and the likely outcomes that follow in the three paths. We conclude with a discussion of how the threat-, opportunity-, and closeness-focused personal identification processes potentially blend, as well as implications for future research and practice

Deactivation of TEM-1 beta-Lactamase investigated by isothermal batch and non-isothermal continuous enzyme membrane reactor methods

The thermal deactivation of TEM-1 β-lactamase was examined using two experimental techniques: a series of isothermal batch assays and a single, continuous, non-isothermal assay in an enzyme membrane reactor (EMR). The isothermal batch-mode technique was coupled with the three-state Equilibrium Model of enzyme deactivation, while the results of the EMR experiment were fitted to a four-state molten globule model . The two methods both led to the conclusions that the thermal deactivation of TEM-1 β -lactamase does not follow the Lumry-Eyring model and that the Teq of the enzyme (the point at which active and inactive states are present in equal amounts due to thermodynamic equilibrium) is at least 10 °C from the Tm (melting temperature), contrary to the idea that the true temperature optimum of a biocatalyst is necessarily close to the melting temperature