Sciweavers

3050 search results - page 178 / 610
» On-line Algorithms in Machine Learning
Sort
View
ICML
2003
IEEE
16 years 7 months ago
The Cross Entropy Method for Fast Policy Search
We present a learning framework for Markovian decision processes that is based on optimization in the policy space. Instead of using relatively slow gradient-based optimization al...
Shie Mannor, Reuven Y. Rubinstein, Yohai Gat
ICML
2002
IEEE
16 years 7 months ago
On generalization bounds, projection profile, and margin distribution
We study generalization properties of linear learning algorithms and develop a data dependent approach that is used to derive generalization bounds that depend on the margin distr...
Ashutosh Garg, Sariel Har-Peled, Dan Roth
ALT
2010
Springer
15 years 8 months ago
Distribution-Dependent PAC-Bayes Priors
We further develop the idea that the PAC-Bayes prior can be informed by the data-generating distribution. We prove sharp bounds for an existing framework of Gibbs algorithms, and ...
Guy Lever, François Laviolette, John Shawe-...
COLT
1999
Springer
15 years 10 months ago
Multiclass Learning, Boosting, and Error-Correcting Codes
We focus on methods to solve multiclass learning problems by using only simple and efficient binary learners. We investigate the approach of Dietterich and Bakiri [2] based on er...
Venkatesan Guruswami, Amit Sahai
ML
2010
ACM
185views Machine Learning» more  ML 2010»
15 years 1 months ago
Learning to rank on graphs
Graph representations of data are increasingly common. Such representations arise in a variety of applications, including computational biology, social network analysis, web applic...
Shivani Agarwal