695 search results - page 67 / 139 » Convex Learning with Invariances |
NIPS
2007
13 years 10 months ago
2007
Learning the common structure shared by a set of supervised tasks is an important practical and theoretical problem. Knowledge of this structure may lead to better generalization ...
PAMI
2006
13 years 8 months ago
2006
Nonparametric neighborhood methods for learning entail estimation of class conditional probabilities based on relative frequencies of samples that are "near-neighbors" of...
ICASSP
2009
IEEE
14 years 3 months ago
2009
IEEE
Recently proposed l1-regularized maximum-likelihood optimization methods for learning sparse Markov networks result into convex problems that can be solved optimally and efficien...
AAAI
2008
13 years 11 months ago
2008
In this paper, we study a sequential decision making problem. The objective is to maximize the average reward accumulated over time subject to temporal cost constraints. The novel...
NIPS
2004
13 years 10 months ago
2004
We present an algorithm based on convex optimization for constructing kernels for semi-supervised learning. The kernel matrices are derived from the spectral decomposition of grap...