495 search results - page 22 / 99 » Approximation algorithms for budgeted learning problems |
PAMI
2008
13 years 8 months ago
2008
We consider the problem of learning a ranking function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on the training data. Relying on an -accurate approxim...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
In this paper we propose an approximated structured prediction framework for large scale graphical models and derive message-passing algorithms for learning their parameters effic...
GECCO
2000
Springer
14 years 2 days ago
2000
Springer
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
ILP
2004
Springer
14 years 1 months ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
ATAL
2007
Springer
14 years 2 months ago
2007
Springer
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...