<?xml version="1.0"?> 
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "mathml.dtd"> 
<?xml-stylesheet type="text/css" href="thesis.css"?> 
<html  
xmlns="http://www.w3.org/1999/xhtml"  
><head><title>1.5 Questions we can answer</title> 
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1" /> 
<meta name="generator" content="TeX4ht (http://www.cis.ohio-state.edu/~gurari/TeX4ht/mn.html)" /> 
<meta name="originator" content="TeX4ht (http://www.cis.ohio-state.edu/~gurari/TeX4ht/mn.html)" /> 
<!-- 3,early_,early^,xhtml,mozilla --> 
<meta name="src" content="thesis.tex" /> 
<meta name="date" content="2002-08-28 13:56:00" /> 
<link rel="stylesheet" type="text/css" href="thesis.css" /> 
</head><body 
>
   <div class="crosslinks"><p class="noindent">[<a 
href="thesisse4.xml" >prev</a>] [<a 
href="thesisse4.xml#tailthesisse4.xml" >prev-tail</a>] [<a 
href="#tailthesisse5.xml">tail</a>] [<a 
href="thesisch1.xml#thesisse5.xml" >up</a>] </p></div>
   <h3 class="sectionHead"><span class="titlemark">1.5. </span> <a 
  name="x9-80001.5"></a>Questions we can answer</h3>
<!--l. 298--><p class="noindent">Our real goal in learning theory is to answer the question &#x201C;When can we
learn?&#x201D; Unfortunately, there is no good answer to this question given only the
assumption of independence. In particular, it may be impossible to learn. The
simplest example of such a learning problem is the case of a distribution <!--l. 301--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
mode="inline">
<mrow 
><mi 
>D</mi></mrow></math>
which always flips a coin in deciding the value of the output <!--l. 302--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
mode="inline">
<mrow 
><mi 
>y</mi></mrow></math>.
The bias of the coin is the same irrespective of the input <!--l. 303--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
mode="inline">
<mrow 
><mi 
>x</mi></mrow></math>. Since
the value of the input is explicitly independent of the output we surely can not hope to
learn a useful relation between the input and output.
</p><!--l. 307--><p class="indent">   Considerable work has been done elsewhere to answer &#x201C;When can we learn?&#x201D;
Typically this is done in models with stronger assumptions&#x2014;for example, under the
additional assumption that the output is related to the input by an &#x201C;OR&#x201D; of a subset of
the input bits.
</p><!--l. 312--><p class="indent">   We will instead focus on a different question: &#x201C;Have we learned?&#x201D; This
question <span 
class="ecti-1000">is </span>answerable in a probabilistic manner. In particular we can make
a statement such as &#x201C;With high probability over samples drawn from <!--l. 314--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
mode="inline">
<mrow 
><mi 
>D</mi></mrow></math> we
have learned if the empirical error is less than some value.&#x201D; In practice, we will want to
know how <span 
class="ecti-1000">much </span>we have learned which we can do by providing a high confidence bound
on the true error rate of the learned hypothesis.
</p><!--l. 320--><p class="indent">
                                                                     

                                                                     
</p>
   <div class="crosslinks"><p class="noindent">[<a 
href="thesisse4.xml" >prev</a>] [<a 
href="thesisse4.xml#tailthesisse4.xml" >prev-tail</a>] [<a 
href="thesisse5.xml" >front</a>] [<a 
href="thesisch1.xml#thesisse5.xml" >up</a>] </p></div><a 
  name="tailthesisse5.xml"></a>  
</body> 
</html> 
