1062 search results - page 37 / 213 » Sublinear Optimization for Machine Learning |
COLT
2008
Springer
13 years 9 months ago
2008
Springer
Coordinate gradient learning is motivated by the problem of variable selection and determining variable covariation. In this paper we propose a novel unifying framework for coordi...
ICMLA
2010
13 years 5 months ago
2010
Learning the reward function of an agent by observing its behavior is termed inverse reinforcement learning and has applications in learning from demonstration or apprenticeship l...
COLT
2010
Springer
13 years 5 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...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
The choice of the kernel function which determines the mapping between the input space and the feature space is of crucial importance to kernel methods. The past few years have se...
ML
2010
ACM
13 years 6 months ago
2010
ACM
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...