On stochastic approximation algorithms for classes of PAC learning problems.
Nageswara S. V. RaoV. R. R. UppuluriE. M. OblowPublished in: IEEE Trans. Syst. Man Cybern. Part B (1997)
Keyphrases
- learning problems
- approximation algorithms
- sample complexity
- pac learning
- np hard
- special case
- learning tasks
- learning algorithm
- supervised learning
- machine learning algorithms
- vertex cover
- constant factor
- machine learning
- kernel methods
- worst case
- computational learning theory
- semi supervised learning
- reinforcement learning
- vc dimension
- approximation ratio
- primal dual
- active learning
- lower bound
- agnostic learning
- function classes
- sample size
- class labels
- pairwise
- training set
- feature selection