Re: GerH source distro at hebbut.net: HOW TO compile/compare/merge for Bill et al

   From: "Ger Hobbelt" <[email protected]>

   On Tue, Apr 1, 2008 at 7:29 PM, Bill Y <[email protected]> wrote:
   >  Hmmm... that sounds like a major failure to converge.
   >
   >  Althogh even when the neural net fails, it doesn't take *that* long
   >  (about two minutes, usually) to run 5000 epochs of training and then
   >  fail gracefully.
   >
   >  So- what test is taking the long time?  You can see it yourself by

   Neural Net.
   See timings on full and reduced test set in megatest elsewhere. NN
   takes it all. At least on 64-bit. ;-) Sorry.

Don't be sorry,  that's good to know.

Try running the "alternating_example_neural.crm" test separately (it's 
standalone .crm code), with -t on.  Remember to delete i_test.css
and q_test.css first.

You should see a cascade of letters crawling up your screen
just like in The Matrix.  Darker letters (more ink) imply
sections of the neural net that got things worse; blanks
are sections that are within the learning tolerance of
being perfect.

In the first section, at around line 36, you should start to 
see some streaks of white space; those should win out by line
63.  The respin (different random number initialization) starts 
to streak at line 97 and then has a single long tail that finally
converges at iteration 200.  

The whole thing takes only about 32 seconds to run on a 1.6 GHz
32-bit Linux laptop.

As a test- can you tell your compiler to generate 32-bit code
and then run the 32-bit code?

This is incompatibility on a _massive_ scale.

     - Bill Yerazunis


-------------------------------------------------------------------------
Check out the new SourceForge.net Marketplace.
It's the best place to buy or sell services for
just about anything Open Source.
http://ad.doubleclick.net/clk;164216239;13503038;w?http://sf.net/marketplace