695 search results - page 31 / 139 » Convex Learning with Invariances |
ICANN
2003
Springer
14 years 3 months ago
2003
Springer
We suggest a new approach to optimize the learning of sparse features under the constraints of explicit transformation symmetries imposed on the set of feature vectors. Given a set...
COLT
2010
Springer
13 years 8 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
EUROCOLT
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
ICPR
2006
IEEE
14 years 11 months ago
2006
IEEE
Geometric methods are very intuitive and provide a theoretically solid viewpoint to many optimization problems. SVM is a typical optimization task that has attracted a lot of atte...
ESA
2010
Springer
13 years 11 months ago
2010
Springer
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...