<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Sample complexity - Page 3 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=sample_complexity&amp;p=2">1.Previous</a><br />
<a accesskey="3" href="page.php?w=sample_complexity&amp;p=4">3.Next</a>
</p>
<p>linear functions) then the sample complexity is finite, and it depends linearly on the <a href="page.php?w=VC_dimension">VC dimension</a> on the class of target functions.</p>

<p><big>Definition</big></p>
<p>Let  be a space which we call the input space, and  be a space which we call the output space, and let  denote the product . For example, in the setting of binary classification,  is typically a finite-dimensional vector space and  is the set .</p>

<p>Fix a hypothesis space  of functions . A learning algorithm over  is a computable map from  to</p><p>
<a accesskey="1" href="page.php?w=sample_complexity&amp;p=2">1.Previous</a><br />
<a accesskey="3" href="page.php?w=sample_complexity&amp;p=4">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
