|
|
Aguilar, O. ed.. Bayesian Time Series Analysis of Stock Selection Strategies.
Abstract: We discuss a general class of Bayesian Dynamic Linear Models for multivariate financial time series. The predictive alpha model attempts to exploit the predictability of the behavior of multiple non-parametric stock selection ranking techniques. The risk component includes the formulation of dynamic factor models with stochastic volatility components for the residual covariance matrix and represents specific varieties of models recently discussed in the growing multivariate stochastic volatility literature. Bayesian inference and computation is developed and explored in a study of the dynamic structure of long/short strategies that shift exposure among various stock selection criteria. We review empirical findings in applying these models to a universe of large capitalization stocks in the US including aspects of model performance in dynamic portfolio allocation. We discuss model assessment, and computational algorithms developed to fit this new class of models and conclude with comments on future potential developments together with model extensions.
Keywords: Bayesian
|
|
|
|
Beal, M., 2003. Variational Algorithms For Approximate Bayesian Inference. Ph.D. thesis. University College London.
Keywords: Bayesian; MarkovModels
|
|
|
|
Boulle, M., 2009. A Parameter-Free Classification Method for Large Scale Learning, Journal of Machine Learning Research, 10, p. 1367–1385.
Abstract: With the rapid growth of computer storage capacities, available data and demand for scoring models both follow an increasing trend, sharper than that of the processing power. However, the main limitation to a wide spread of data mining solutions is the non-increasing availability of skilled data analysts, which play a key role in data preparation and model selection. In this paper, we present a parameter-free scalable classification method, which is a step towards fully automatic data mining. The method is based on Bayes optimal univariate conditional density estimators, naive Bayes classification enhanced with a Bayesian variable selection scheme, and averaging of models using a logarithmic smoothing of the posterior distribution. We focus on the complexity of the algorithms and show how they can cope with data sets that are far larger than the available central memory. We finally report results on the Large Scale Learning challenge, where our method obtains state of the art performance within practicable computation time.
Keywords: Bayesian; LargeScaleLearning
|
|
|
|
Chavez, O.A., 1998. Latent Structure in Bayesian Multivariate Time Series Models. Ph.D. thesis. Duke University.
Abstract: This dissertation introduces new classes of models and approaches to multivariate time series analysis and forecasting, with a focus on various problems in which time series structure is driven by underlying latent processes of key interest. The identi- cation of latent structure and common features in multiple time series is rst studied using wavelet based methods and Bayesian time series decompositions of certain classes of dynamic linear models. The results are applied to turbulence and geochemical time series data, the latter involving development of new time series models for latent time-varying autoregressions with heavy-tailed components for quite radically ill-behaved series. Natural extensions and generalizations of these models lead to novel developments of two key model classes, dynamic factor models for multivariate nancial time series with stochastic volatility components, and multivariate dynamic generalized linear models for non-Gaussian longitudinal time series. These two model classes are related through common statistical structure, and the dissertation discusses issues of Bayesian model specication, model tting and computation for posterior and predictive analysis that are common to the two model classes. Two motivating applications are discussed, one in each of the two model classes. The rst concerns short term forecasting and dynamic portfolio allocation, illustrated in a study of the dynamic factor structure of daily spot exchange rates for a selection of international currencies. The second application involves analyses of time series of collections of many related binomial outcomes and arises in a project in health care quality monitoring with the Veterans Aairs (VA) hospital system.
Keywords: Bayesian
|
|
|
|
Ghahramani, Z., 2001. An Introduction to Hidden Markov Models and Bayesian Networks, International Journal of Pattern Recognition and Artificial Intelligence, 15 (1), p. 9–42.
Keywords: Bayesian; MarkovModels
|
|
|
|
Ghahramani, Z. ed., 2005. Non-parametric Bayesian Methods.
|
|
|
|
Greenshtein, E. & Park, J., 2009. Application of Non Parametric Empirical Bayes Estimation to High Dimensional Classification, Journal of Machine Learning Research, 10, p. 1687–1704.
Abstract: We consider the problem of classification using high dimensional features’ space. In a paper by Bickel and Levina (2004), it is recommended to use naive-Bayes classifiers, that is, to treat the features as if they are statistically independent. Consider now a sparse setup, where only a few of the features are informative for classification. Fan and Fan (2008), suggested a variable selection and classification method, called FAIR. The FAIR method improves the design of naive-Bayes classifiers in sparse setups. The improvement is due to reducing the noise in estimating the features’ means. This reduction is since that only the means of a few selected variables should be estimated. We also consider the design of naive Bayes classifiers. We show that a good alternative to variable selection is estimation of the means through a certain non parametric empirical Bayes procedure. In sparse setups the empirical Bayes implicitly performs an efficient variable selection. It also adapts very well to non sparse setups, and has the advantage of making use of the information from many “weakly informative” variables, which variable selection type of classification procedures give up on using. We compare our method with FAIR and other classification methods in simulation for sparse and non sparse setups, and in real data examples involving classification of normal versus malignant tissues based on microarray data.
Keywords: Bayesian; LargeScaleLearning
|
|
|
|
Li, L., 2007. Bayesian Classification and Regression with High Dimensional Features. Ph.D. thesis. University of Toronto.
Abstract: This thesis responds to the challenges of using a large number, such as thousands, of features in regression and classification problems. There are two situations where such high dimensional features arise. One is when high dimensional measurements are available, for example, gene expression data produced by microarray techniques. For computational or other reasons, people may select only a small subset of features when modelling such data, by looking at how relevant the features are to predicting the response, based on some measure such as correlation with the response in the training data. Although it is used very commonly, this procedure will make the response appear more predictable than it actually is. In Chapter 2, we propose a Bayesian method to avoid this selection bias, with application to naive Bayes models and mixture models. High dimensional features also arise when we consider high-order interactions. The num- ber of parameters will increase exponentially with the order considered. In Chapter 3, we propose a method for compressing a group of parameters into a single one, by exploiting the fact that many predictor variables derived from high-order interactions have the same values for all the training cases. The number of compressed parameters may have converged before considering the highest possible order. We apply this compression method to logistic sequence prediction models and logistic classification models. We use both simulated data and real data to test our methods in both chapters.
Keywords: Bayesian; LargeScaleLearning
|
|