Sciweavers

539 search results - page 23 / 108
» Learning Monotonic Linear Functions
Sort
View
ICML
2009
IEEE
14 years 8 months ago
Efficient Euclidean projections in linear time
We consider the problem of computing the Euclidean projection of a vector of length n onto a closed convex set including the 1 ball and the specialized polyhedra employed in (Shal...
Jun Liu, Jieping Ye
STOC
2004
ACM
102views Algorithms» more  STOC 2004»
14 years 8 months ago
A simple polynomial-time rescaling algorithm for solving linear programs
The perceptron algorithm, developed mainly in the machine learning literature, is a simple greedy method for finding a feasible solution to a linear program (alternatively, for le...
John Dunagan, Santosh Vempala
NIPS
2003
13 years 9 months ago
Log-Linear Models for Label Ranking
Label ranking is the task of inferring a total order over a predefined set of labels for each given instance. We present a general framework for batch learning of label ranking f...
Ofer Dekel, Christopher D. Manning, Yoram Singer
EUROGP
2008
Springer
105views Optimization» more  EUROGP 2008»
13 years 9 months ago
A Linear Estimation-of-Distribution GP System
We present N-gram GP, an estimation of distribution algorithm for the evolution of linear computer programs. The algorithm learns and samples the joint probability distribution of...
Riccardo Poli, Nicholas Freitag McPhee
PAMI
2006
147views more  PAMI 2006»
13 years 7 months ago
Bayesian Gaussian Process Classification with the EM-EP Algorithm
Gaussian process classifiers (GPCs) are Bayesian probabilistic kernel classifiers. In GPCs, the probability of belonging to a certain class at an input location is monotonically re...
Hyun-Chul Kim, Zoubin Ghahramani