695 search results - page 107 / 139 » Convex Learning with Invariances |
COLT
2007
Springer
14 years 23 days ago
2007
Springer
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
NIPS
2008
13 years 10 months ago
2008
Learning graphical models with hidden variables can offer semantic insights to complex data and lead to salient structured predictors without relying on expensive, sometime unatta...
ICML
2010
IEEE
13 years 10 months ago
2010
IEEE
We present a new algorithm for minimizing a convex loss-function subject to regularization. Our framework applies to numerous problems in machine learning and statistics; notably,...
COLT
2010
Springer
13 years 6 months ago
2010
Springer
Multiarmed bandit problem is a typical example of a dilemma between exploration and exploitation in reinforcement learning. This problem is expressed as a model of a gambler playi...
ICPR
2008
IEEE
14 years 10 months ago
2008
IEEE
In this work we investigate the relationship between Bregman distances and regularized Logistic Regression model. We present a detailed study of Bregman Distance minimization, a f...