diff options
| author | ziejd2 | 2017-09-28 15:04:40 -0500 |
|---|---|---|
| committer | ziejd2 | 2017-09-28 15:04:40 -0500 |
| commit | 8070dc963753142bb86c4ed698d91fd623ed28e7 (patch) | |
| tree | d0f6dd8fc46a49b819aa55c1a90faa14d8448883 /sourcecodes/bnt-master/nethelp3.3/glmtrain.htm | |
| parent | 7cc31810d53176e805532b2789955f4eedbce6bb (diff) | |
| download | BNW-8070dc963753142bb86c4ed698d91fd623ed28e7.tar.gz | |
BNW using Octave instead of Matlab.
This version of BNW should perform the same as the original version. The only difference is that it uses Octave instead of Matlab when running BayesNet Toolbox during parameter learning. I am calling this BNW_1.02. It can be accessed at: compbio.uthsc.edu/BNW_1.02
Diffstat (limited to 'sourcecodes/bnt-master/nethelp3.3/glmtrain.htm')
| -rw-r--r-- | sourcecodes/bnt-master/nethelp3.3/glmtrain.htm | 71 |
1 files changed, 71 insertions, 0 deletions
diff --git a/sourcecodes/bnt-master/nethelp3.3/glmtrain.htm b/sourcecodes/bnt-master/nethelp3.3/glmtrain.htm new file mode 100644 index 00000000..a52ada6d --- /dev/null +++ b/sourcecodes/bnt-master/nethelp3.3/glmtrain.htm @@ -0,0 +1,71 @@ +<html> +<head> +<title> +Netlab Reference Manual glmtrain +</title> +</head> +<body> +<H1> glmtrain +</H1> +<h2> +Purpose +</h2> +Specialised training of generalized linear model + +<p><h2> +Description +</h2> +<CODE>net = glmtrain(net, options, x, t)</CODE> uses +the iterative reweighted least squares (IRLS) +algorithm to set the weights in the generalized linear model structure +<CODE>net</CODE>. This is a more efficient alternative to using <CODE>glmerr</CODE> +and <CODE>glmgrad</CODE> and a non-linear optimisation routine through +<CODE>netopt</CODE>. +Note that for linear outputs, a single pass through the +algorithm is all that is required, since the error function is quadratic in +the weights. The algorithm also handles scalar <CODE>alpha</CODE> and <CODE>beta</CODE> +terms. If you want to use more complicated priors, you should use +general-purpose non-linear optimisation algorithms. + +<p>For logistic and softmax outputs, general priors can be handled, although +this requires the pseudo-inverse of the Hessian, giving up the better +conditioning and some of the speed advantage of the normal form equations. + +<p>The error function value at the final set of weights is returned +in <CODE>options(8)</CODE>. +Each row of <CODE>x</CODE> corresponds to one +input vector and each row of <CODE>t</CODE> corresponds to one target vector. + +<p>The optional parameters have the following interpretations. + +<p><CODE>options(1)</CODE> is set to 1 to display error values during training. +If <CODE>options(1)</CODE> is set to 0, +then only warning messages are displayed. If <CODE>options(1)</CODE> is -1, +then nothing is displayed. + +<p><CODE>options(2)</CODE> is a measure of the precision required for the value +of the weights <CODE>w</CODE> at the solution. + +<p><CODE>options(3)</CODE> is a measure of the precision required of the objective +function at the solution. Both this and the previous condition must be +satisfied for termination. + +<p><CODE>options(5)</CODE> is set to 1 if an approximation to the Hessian (which assumes +that all outputs are independent) is used for softmax outputs. With the default +value of 0 the exact Hessian (which is more expensive to compute) is used. + +<p><CODE>options(14)</CODE> is the maximum number of iterations for the IRLS algorithm; +default 100. + +<p><h2> +See Also +</h2> +<CODE><a href="glm.htm">glm</a></CODE>, <CODE><a href="glmerr.htm">glmerr</a></CODE>, <CODE><a href="glmgrad.htm">glmgrad</a></CODE><hr> +<b>Pages:</b> +<a href="index.htm">Index</a> +<hr> +<p>Copyright (c) Ian T Nabney (1996-9) + + +</body> +</html> \ No newline at end of file |