In this paper, we consider a smoothing kernelbased classification rule and propose an algorithm for optimizing the performance of the rule by learning the bandwidth of the smoothi...
Bharath K. Sriperumbudur, Omer A. Lang, Gert R. G....
While there is a very long tradition of approximating a data array by projecting row or column vectors into a lower dimensional subspace the direct approximation of a data matrix ...
Nonsmoothness pervades optimization, but the way it typically arises is highly structured. Nonsmooth behavior of an objective function is usually associated, locally, with an activ...
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
We present an approach to modeling the average case behavior of learning algorithms. Our motivation is to predict the expected accuracy of learning algorithms as a function of the...