Kulkarni, S. R. ; Vidyasagar, M.
(1997)
*Learning decision rules for pattern classification under a family of probability measures*
IEEE Transactions on Information Theory, 43
(1).
pp. 154-166.
ISSN 0018-9448

Full text not available from this repository.

Official URL: http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arn...

Related URL: http://dx.doi.org/10.1109/18.567668

## Abstract

In this paper, uniformly consistent estimation (learnability) of decision rules for pattern classification under a family of probability measures is investigated. In particular, it is shown that uniform boundedness of the metric entropy of the class of decision rules is both necessary and sufficient for learnability under each of two conditions: (i) the family of probability measures is totally bounded, with respect to the total variation metric, and (ii) the family of probability measures contains an interior point, when equipped with the same metric. In particular, this shows that insofar as uniform consistency is concerned, when the family of distributions contains a total variation neighborhood, nothing is gained by this knowledge about the distribution. Then two sufficient conditions for learnability are presented. Specifically, it is shown that learnability with respect to each of a finite collection of families of probability measures implies learnability with respect to their union; also, learnability with respect to each of a finite number of measures implies learnability with respect to the convex hull of the corresponding families of uniformly absolutely continuous probability measures.

Item Type: | Article |
---|---|

Source: | Copyright of this article belongs to IEEE. |

ID Code: | 56921 |

Deposited On: | 25 Aug 2011 09:35 |

Last Modified: | 25 Aug 2011 09:35 |

Repository Staff Only: item control page