Improper Learning by Refuting

ITCS, pp. 55:1-55:10, 2018.

Cited by: 4|Bibtex|Views14|Links
EI

Abstract:

The sample complexity of learning a Boolean-valued function class is precisely characterized by its Rademacher complexity. This has little bearing, however, on the sample complexity of efficient agnostic learning. We introduce refutation complexity, a natural computational analog of Rademacher complexity of a Boolean concept class and sho...More

Code:

Data:

Your rating :
0

 

Tags
Comments