716 search results - page 36 / 144 » Optimizing Sorting with Machine Learning Algorithms |
150
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
A recent trend in exemplar based unsupervised learning is to formulate the learning problem as a convex optimization problem. Convexity is achieved by restricting the set of possi...
138
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
We present a general Bayesian framework for hyperparameter tuning in L2-regularized supervised learning models. Paradoxically, our algorithm works by first analytically integratin...
163
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
Mobile robots often rely upon systems that render sensor data and perceptual features into costs that can be used in a planner. The behavior that a designer wishes the planner to ...
173
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
163
click to vote
PAA
2010
15 years 4 months ago
2010
By applying recent results in optimization theory variously known as optimization transfer or majorize/minimize algorithms, an algorithm for binary, kernel, Fisher discriminant ana...