Bayesian analysis of binary sequences

作者:

Highlights:

摘要

This manuscript details Bayesian methodology for “learning by example”, with binary n-sequences encoding the objects under consideration. Priors prove influential; conformable priors are described. Laplace approximation of Bayes integrals yields posterior likelihoods for all n-sequences. This involves the optimization of a definite function over a convex domain—efficiently effectuated by the sequential application of the quadratic program.

论文关键词:primary: 62F15,secondary: 60C05,65K05,Concave,Convex,Cut polytope,Geometric probability,Laplace approximation,Machine learning,Moments,Nonlinear optimization,Polytope,Posterior likelihoods,Probability monomials,Quadratic program,Semidefinite

论文评审过程:Received 28 January 2003, Revised 18 April 2004, Available online 17 July 2004.

论文官网地址:https://doi.org/10.1016/j.cam.2004.05.010