Search

Let X1, … , Xn be compact spaces and X = X1 x…xXn. Consider the approximation of a function f ϵ C(X) by sums g1(x1)+…+gn(xn), where gi ϵ C(Xi ), i = 1, … , n. In [8], Golomb obtained a formula for the error of this approximation in terms of measures constructed on special points of X, called 'projection cycles'. However, his proof had a gap, which was pointed out by Marshall and O'Farrell [15]. But the question if the formula was correct, remained open. The purpose of the paper is to prove that Golomb's formula holds in a stronger form. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to provide an error analysis for the multicategory support vector machine (MSVM) classificaton problems. We establish the uniform convergency approach for MSVMs and estimate the misclassification error. The main difficulty we overcome here is to bound the offset vector. As a result, we confirm that the MSVM classification algorithm with polynomial kernels is always efficient when the degree of the kernel polynomial is large enough. Finally the rate of convergence and examples are given to demonstrate the main results. [ABSTRACT FROM AUTHOR]