Sciweavers

4366 search results - page 48 / 874
» Learning and Smoothed Analysis
Sort
View
ICML
2008
IEEE
14 years 8 months ago
Metric embedding for kernel classification rules
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....
CORR
2006
Springer
146views Education» more  CORR 2006»
13 years 7 months ago
The Haar Wavelet Transform of a Dendrogram
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 ...
Fionn Murtagh
SIAMJO
2002
99views more  SIAMJO 2002»
13 years 7 months ago
Active Sets, Nonsmoothness, and Sensitivity
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...
A. S. Lewis
STACS
1999
Springer
14 years 14 hour ago
A Complete and Tight Average-Case Analysis of Learning Monomials
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...
Rüdiger Reischuk, Thomas Zeugmann
ICML
1990
IEEE
13 years 11 months ago
Average Case Analysis of Conjunctive Learning Algorithms
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...
Michael J. Pazzani, Wendy Sarrett