Sciweavers

1106 search results - page 82 / 222
» On regularization algorithms in learning theory
Sort
View
WWW
2008
ACM
16 years 5 months ago
Measuring extremal dependencies in web graphs
We analyze dependencies in power law graph data (Web sample, Wikipedia sample and a preferential attachment graph) using statistical inference for multivariate regular variation. ...
Yana Volkovich, Nelly Litvak, Bert Zwart
CVPR
2010
IEEE
16 years 1 months ago
Comparative object similarity for improved recognition with few or no examples
Learning models for recognizing objects with few or no training examples is important, due to the intrinsic longtailed distribution of objects in the real world. In this paper, we...
Gang Wang, David Forsyth, Derek Hoiem
ICML
2000
IEEE
16 years 5 months ago
Learning Subjective Functions with Large Margins
In manyoptimization and decision problems the objective function can be expressed as a linear combinationof competingcriteria, the weights of whichspecify the relative importanceo...
Claude-Nicolas Fiechter, Seth Rogers
136
Voted
STOC
2003
ACM
122views Algorithms» more  STOC 2003»
16 years 5 months ago
Learning juntas
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
183
Voted
CVPR
2008
IEEE
16 years 7 months ago
Rank-based distance metric learning: An application to image retrieval
We present a novel approach to learn distance metric for information retrieval. Learning distance metric from a number of queries with side information, i.e., relevance judgements...
Jung-Eun Lee, Rong Jin, Anil K. Jain