Sciweavers

1454 search results - page 154 / 291
» Learning with cost intervals
Sort
View
ICML
2010
IEEE
15 years 7 months ago
Risk minimization, probability elicitation, and cost-sensitive SVMs
A new procedure for learning cost-sensitive SVM classifiers is proposed. The SVM hinge loss is extended to the cost sensitive setting, and the cost-sensitive SVM is derived as the...
Hamed Masnadi-Shirazi, Nuno Vasconcelos
ICML
2010
IEEE
15 years 7 months ago
Convergence of Least Squares Temporal Difference Methods Under General Conditions
We consider approximate policy evaluation for finite state and action Markov decision processes (MDP) in the off-policy learning context and with the simulation-based least square...
Huizhen Yu
ICML
2003
IEEE
16 years 7 months ago
Online Convex Programming and Generalized Infinitesimal Gradient Ascent
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
Martin Zinkevich
CE
2008
91views more  CE 2008»
15 years 6 months ago
Mining e-Learning domain concept map from academic articles
Recent researches have demonstrated the importance of concept map and its versatile applications especially in e-Learning. For example, while designing adaptive learning materials...
Nian-Shing Chen, Kinshuk, Chun-Wang Wei, Hong-Jhe ...
CGO
2008
IEEE
16 years 27 days ago
Latency-tolerant software pipelining in a production compiler
In this paper we investigate the benefit of scheduling non-critical loads for a higher latency during software pipelining. "Noncritical" denotes those loads that have s...
Sebastian Winkel, Rakesh Krishnaiyer, Robyn Sampso...