76 search results - page 10 / 16 » Agnostically Learning Halfspaces |
MLDM
2009
Springer
14 years 1 months ago
2009
Springer
A number of two-class classification methods first discretize each attribute of two given training sets and then construct a propositional DNF formula that evaluates to True for ...
DAGM
2011
Springer
12 years 6 months ago
2011
Springer
The supervised learning paradigm assumes in general that both training and test data are sampled from the same distribution. When this assumption is violated, we are in the setting...
ICVGIP
2008
13 years 8 months ago
2008
As vision algorithms mature with increasing inspiration from the learning community, statistically independent pseudo random number generation (PRNG) becomes increasingly importan...
COLT
2008
Springer
13 years 8 months ago
2008
Springer
In recent work, Kalai, Klivans, Mansour, and Servedio [KKMS05] studied a variant of the "Low-Degree (Fourier) Algorithm" for learning under the uniform probability distr...
JMLR
2012
11 years 9 months ago
2012
Contextual bandit learning is a reinforcement learning problem where the learner repeatedly receives a set of features (context), takes an action and receives a reward based on th...