Sciweavers

3643 search results - page 228 / 729
» Learning Submodular Functions
Sort
View
ICML
2008
IEEE
16 years 7 months ago
Random classification noise defeats all convex potential boosters
A broad class of boosting algorithms can be interpreted as performing coordinate-wise gradient descent to minimize some potential function of the margins of a data set. This class...
Philip M. Long, Rocco A. Servedio
ALT
2004
Springer
16 years 3 months ago
Complexity of Pattern Classes and Lipschitz Property
Rademacher and Gaussian complexities are successfully used in learning theory for measuring the capacity of the class of functions to be learned. One of the most important propert...
Amiran Ambroladze, John Shawe-Taylor
GECCO
2009
Springer
151views Optimization» more  GECCO 2009»
16 years 1 months ago
Swarming to rank for information retrieval
This paper presents an approach to automatically optimize the retrieval quality of ranking functions. Taking a Swarm Intelligence perspective, we present a novel method, SwarmRank...
Ernesto Diaz-Aviles, Wolfgang Nejdl, Lars Schmidt-...
COLT
1999
Springer
15 years 11 months ago
Uniform-Distribution Attribute Noise Learnability
We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and sho...
Nader H. Bshouty, Jeffrey C. Jackson, Christino Ta...
HUMO
2000
Springer
15 years 10 months ago
Specialized Mappings and the Estimation of Human Body Pose from a Single Image
We present an approach for recovering articulated body pose from single monocular images using the Specialized Mappings Architecture (SMA), a non-linear supervised learning archit...
Rómer Rosales, Stan Sclaroff