495 search results - page 59 / 99 » Approximation algorithms for budgeted learning problems |
116
click to vote
JMLR
2012
13 years 4 days ago
2012
In this paper, we propose a novel formulation of the network clique detection problem by introducing a general network data representation framework. We show connections between o...
113
click to vote
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse,...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract— A distributed online learning framework for support vector machines (SVMs) is presented and analyzed. First, the generic binary classification problem is decomposed in...
81
Voted
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
NIPS
2007
14 years 11 months ago
2007
Learning in real-world domains often requires to deal with continuous state and action spaces. Although many solutions have been proposed to apply Reinforcement Learning algorithm...