Sciweavers

1062 search results - page 113 / 213
» Sublinear Optimization for Machine Learning
Sort
View
ICML
2007
IEEE
16 years 3 months ago
Learning distance function by coding similarity
We consider the problem of learning a similarity function from a set of positive equivalence constraints, i.e. 'similar' point pairs. We define the similarity in informa...
Aharon Bar-Hillel, Daphna Weinshall
ACML
2009
Springer
15 years 8 months ago
Coupled Metric Learning for Face Recognition with Degraded Images
Real-world face recognition systems are sometimes confronted with degraded face images, e.g., low-resolution, blurred, and noisy ones. Traditional two-step methods have limited per...
Bo Li, Hong Chang, Shiguang Shan, Xilin Chen
112
Voted
ML
2006
ACM
142views Machine Learning» more  ML 2006»
15 years 2 months ago
The max-min hill-climbing Bayesian network structure learning algorithm
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and sea...
Ioannis Tsamardinos, Laura E. Brown, Constantin F....
COLT
2010
Springer
15 years 7 days ago
Learning Rotations with Little Regret
We describe online algorithms for learning a rotation from pairs of unit vectors in Rn . We show that the expected regret of our online algorithm compared to the best fixed rotati...
Elad Hazan, Satyen Kale, Manfred K. Warmuth
COLT
2007
Springer
15 years 8 months ago
A Lower Bound for Agnostically Learning Disjunctions
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
Adam R. Klivans, Alexander A. Sherstov