Sciweavers

157 search results - page 31 / 32
» icml 2007
Sort
View
ICML
2008
IEEE
14 years 7 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
ICML
2007
IEEE
14 years 7 months ago
Pegasos: Primal Estimated sub-GrAdient SOlver for SVM
We describe and analyze a simple and effective iterative algorithm for solving the optimization problem cast by Support Vector Machines (SVM). Our method alternates between stocha...
Shai Shalev-Shwartz, Yoram Singer, Nathan Srebro
ICML
2007
IEEE
14 years 7 months ago
Boosting for transfer learning
Traditional machine learning makes a basic assumption: the training and test data should be under the same distribution. However, in many cases, this identicaldistribution assumpt...
Wenyuan Dai, Qiang Yang, Gui-Rong Xue, Yong Yu
ICML
2007
IEEE
14 years 7 months ago
A fast linear separability test by projection of positive points on subspaces
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
A. P. Yogananda, M. Narasimha Murty, Lakshmi Gopal
ICML
2007
IEEE
14 years 7 months ago
Learning to rank: from pairwise approach to listwise approach
The paper is concerned with learning to rank, which is to construct a model or a function for ranking objects. Learning to rank is useful for document retrieval, collaborative fil...
Zhe Cao, Tao Qin, Tie-Yan Liu, Ming-Feng Tsai, Han...