In unidentifiable models, the Bayes estimation has the advantage of generalization performance over the maximum likelihood estimation. However, accurate approximation of the posterior distribution requires huge computational costs. In this paper, we consider an alternative approximation method, which we call a subspace Bayes approach. A subspace Bayes approach is an empirical Bayes approach whe...

For the problem of variable selection for the normal linear model, fixed penalty selection criteria such as AIC, Cp, BIC and RIC correspond to the posterior modes of a hierarchical Bayes model for various fixed hyperparameter settings. Adaptive selection criteria obtained by empirical Bayes estimation of the hyperparameters have been shown by George and Foster [2000. Calibration and Empirical B...

Consider an experiment yielding an observable random quantity X whose distribution Fθ depends on a parameter θ with θ being distributed according to some distribution G0. We study the Bayesian estimation problem of θ under squared error loss function based on X, as well as some additional data available from other similar experiments according to an empirical Bayes structure. In a recent paper,...

We augment the naive Bayes model with an n-gram language model to address two shortcomings of naive Bayes text classifiers. The chain augmented naive Bayes classifiers we propose have two advantages over standard naive Bayes classifiers. First, a chain augmented naive Bayes model relaxes some of the independence assumptions of naive Bayes—allowing a local Markov chain dependence in the observed...

an estimation problem of the mean µ of an inverse gaussian distribution ig(µ, c µ) with known coefficient of variation c is treated as a decision problem with entropy loss function. a class of bayes estimators is constructed, and shown to include mrse estimator as its closure. two important members of this class can easily be computed using continued fractions

We generalize the approach of Liu and Lawrence (1999) for multiple changepoint problems where the number of changepoints is unknown. The approach is based on dynamic programming recursion for efficient calculation of the marginal probability of the data with the hidden parameters integrated out. For the estimation of the hyperparameters, we propose to use Monte Carlo EM when training data are a...