3204 search results - page 79 / 641 » Online Learning with Constraints |
NIPS
2001
13 years 10 months ago
2001
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...
JMLR
2010
13 years 3 months ago
2010
Many real world applications employ multivariate performance measures and each example can belong to multiple classes. The currently most popular approaches train an SVM for each ...
TNN
2010
13 years 3 months ago
2010
In this paper, a novel real-time online network model is presented. It is derived from the hierarchical radial basis function (HRBF) model and it grows by automatically adding unit...
JSAC
2010
13 years 7 months ago
2010
Abstract—In this paper, we study how to optimize the transmission decisions of nodes aimed at supporting mission-critical applications, such as surveillance, security monitoring,...
JMLR
2012
11 years 11 months ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...