Timezone: »

 
Poster
Human Rademacher Complexity
Jerry Zhu · Timothy T Rogers · Bryan R Gibson

Tue Dec 08 07:00 PM -- 11:59 PM (PST) @
in Poster Session »

We propose to use Rademacher complexity, originally developed in computational learning theory, as a measure of human learning capacity. Rademacher complexity measures a learners ability to fit random data, and can be used to bound the learners true error based on the observed training sample error. We first review the definition of Rademacher complexity and its generalization bound. We then describe a "learning the noise" procedure to experimentally measure human Rademacher complexities. The results from empirical studies showed that: (i) human Rademacher complexity can be successfully measured, (ii) the complexity depends on the domain and training sample size in intuitive ways, (iii) human learning respects the generalization bounds, (iv) the bounds can be useful in predicting the danger of overfitting in human learning. Finally, we discuss the potential applications of human Rademacher complexity in cognitive science.

[ PDF] 

Author Information

Jerry Zhu (University of Wisconsin-Madison)
Timothy T Rogers (University of Wisconsin-Madison)
Bryan R Gibson (University of Wisconsin-Madison)

More from the Same Authors