CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2003 vol.25 Issue No.09 - September
Issue No.09 - September (2003 vol.25)
M?rio A.T. Figueiredo , IEEE
<p><b>Abstract</b>—The goal of supervised learning is to infer a functional mapping based on a set of training examples. To achieve good generalization, it is necessary to control the "complexity" of the learned function. In Bayesian approaches, this is done by adopting a prior for the parameters of the function being learned. We propose a Bayesian approach to supervised learning, which leads to sparse solutions; that is, in which irrelevant parameters are automatically set exactly to zero. Other ways to obtain sparse classifiers (such as Laplacian priors, support vector machines) involve (hyper)parameters which control the degree of sparseness of the resulting classifiers; these parameters have to be somehow adjusted/estimated from the training data. In contrast, our approach does not involve any (hyper)parameters to be adjusted or estimated. This is achieved by a hierarchical-Bayes interpretation of the Laplacian prior, which is then modified by the adoption of a Jeffreys' noninformative hyperprior. Implementation is carried out by an expectation-maximization (EM) algorithm. Experiments with several benchmark data sets show that the proposed approach yields state-of-the-art performance. In particular, our method outperforms SVMs and performs competitively with the best alternative techniques, although it involves no tuning or adjustment of sparseness-controlling hyperparameters.</p>
Supervised learning, classification, regression, sparseness, feature selection, kernel methods, expectation-maximization algorithm.
M?rio A.T. Figueiredo, "Adaptive Sparseness for Supervised Learning", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.25, no. 9, pp. 1150-1159, September 2003, doi:10.1109/TPAMI.2003.1227989