<?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="Empirical risk minimization - Page 1 - Wikipedia">
<p>
<a accesskey="3" href="page.php?w=empirical_risk_minimization&amp;p=2">3.Next</a>
</p>
<p>In <a href="page.php?w=statistical_learning_theory">statistical learning theory</a>, the principle of <b>empirical risk minimization</b> defines a family of <a href="page.php?w=machine_learning">learning algorithms</a> based on evaluating performance over a known and fixed dataset. The core idea is based on an application of the <a href="page.php?w=law_of_large_numbers">law of large numbers</a>; more specifically, we cannot know exactly how well a predictive algorithm will work in practice (i.e. the "true risk") because we do not know the true</p><p>
<a accesskey="3" href="page.php?w=empirical_risk_minimization&amp;p=2">3.Next</a>
</p>

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

</card>
</wml>
