695 search results - page 12 / 139 » Convex Learning with Invariances |
TIT
1998
13 years 7 months ago
1998
We show that if the closureof a function class F under the metric induced by some probability distribution is not convex, then the sample complexity for agnostically learning F wi...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper describes a new approach to unify constraints on parameters with training data to perform parameter estimation in Bayesian networks of known structure. The method is ge...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
In many vision problems, rotation-invariant analysis is necessary or preferred. Popular solutions are mainly based on pose normalization or brute-force learning, neglecting the in...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Sparse methods for supervised learning aim at finding good linear predictors from as few variables as possible, i.e., with small cardinality of their supports. This combinatorial ...
COLT
2010
Springer
13 years 5 months ago
2010
Springer
We study the regret of an online learner playing a multi-round game in a Banach space B against an adversary that plays a convex function at each round. We characterize the minima...