Bayesian Non- and Semi-parametric Methods and Applications
Peter E. Rossi
This book reviews and develops Bayesian non-parametric and semi-parametric methods for applications in microeconometrics and quantitative marketing. Most econometric models used in microeconomics and marketing applications involve arbitrary distributional assumptions. As more data becomes available, a natural desire to provide methods that relax these assumptions arises. Peter Rossi advocates a Bayesian approach in which specific distributional assumptions are replaced with more flexible distributions based on mixtures of normals. The Bayesian approach can use either a large but fixed number of normal components in the mixture or an infinite number bounded only by the sample size. By using flexible distributional approximations instead of fixed parametric models, the Bayesian approach can reap the advantages of an efficient method that models all of the structure in the data while retaining desirable smoothing properties. Non-Bayesian non-parametric methods often require additional ad hoc rules to avoid "overfitting," in which resulting density approximates are nonsmooth. With proper priors, the Bayesian approach largely avoids overfitting, while retaining flexibility. This book provides methods for assessing informative priors that require only simple data normalizations. The book also applies the mixture of the normals approximation method to a number of important models in microeconometrics and marketing, including the non-parametric and semi-parametric regression models, instrumental variables problems, and models of heterogeneity. In addition, the author has written a free online software package in R, "bayesm," which implements all of the non-parametric models discussed in the book.
Peter E. Rossi is the James Collins Professor of Marketing, Economics, and Statistics at UCLA's Anderson School of Management. He has published widely in marketing, economics, statistics, and econometrics and is a coauthor of Bayesian Statistics and Marketing.