Bayesian support vector regression using a unified loss function

Authors:
Wei Chu;S. S. Keerthi;Chong Jin Ong
Affiliations:
Gatsby Comput. Neurosci. Unit, Univ. Coll. London, UK;-;-
Venue:
IEEE Transactions on Neural Networks
Year:
2004

Citing 0
Cited 11

Leave-One-Out Bounds for Support Vector Regression Model Selection

Neural Computation
An Equivalence between SILF-SVR and Ordinary Kriging

Neural Processing Letters
Support vector machines for dyadic data

Neural Computation
Construction of Bayesian support vector regression in the feature space spanned by Bezier-Bernstein polynomial functions

Cybernetics and Systems Analysis
Feature selection via sensitivity analysis of SVM probabilistic outputs

Machine Learning
Gaussian processes and limiting linear models

Computational Statistics & Data Analysis
An enhanced generalized adaptive resonance theory neural network and its application to medical pattern classification

Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
Dimensionality Estimation, Manifold Learning and Function Approximation using Tensor Voting

The Journal of Machine Learning Research
Feature selection for support vector regression using probabilistic prediction

Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Bayesian multiple response kernel regression model for high dimensional data and its practical applications in near infrared spectroscopy

Computational Statistics & Data Analysis
On-line Support Vector Regression of the transition model for the Kalman filter

Image and Vision Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we use a unified loss function, called the soft insensitive loss function, for Bayesian support vector regression. We follow standard Gaussian processes for regression to set up the Bayesian framework, in which the unified loss function is used in the likelihood evaluation. Under this framework, the maximum a posteriori estimate of the function values corresponds to the solution of an extended support vector regression problem. The overall approach has the merits of support vector regression such as convex quadratic programming and sparsity in solution representation. It also has the advantages of Bayesian methods for model adaptation and error bars of its predictions. Experimental results on simulated and real-world data sets indicate that the approach works well even on large data sets.