495 search results - page 43 / 99 » Approximation algorithms for budgeted learning problems |
STOC
1994
ACM
15 years 1 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
ECML
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In contrast to the standard inductive inference setting of predictive machine learning, in real world learning problems often the test instances are already available at ...
NIPS
2007
14 years 11 months ago
2007
The learning of probabilistic models with many hidden variables and nondecomposable dependencies is an important and challenging problem. In contrast to traditional approaches bas...
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...
AAAI
2006
14 years 11 months ago
2006
We discuss the problem of finding a good state representation in stochastic systems with observations. We develop a duality theory that generalizes existing work in predictive sta...