September 2008


Options: Use Monospaced Font
Show Text Part by Default
Show All Mail Headers

Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Sean Luke <[log in to unmask]>
Reply To:
Sun, 28 Sep 2008 12:18:40 -0400
text/plain (37 lines)
There was someone who bytecode compilation of individuals using ECJ.  I 
forget whom though, I thought they posted here a while ago.  :-(  At any 
rate, there's several bytecode-generation GP systems listed on the ECJ 
webpage.  Check 'em out  before rolling your own.


adil raja wrote:
> Hi,
>    I presume that you are talking about converting the tree to a java source file and then compiling it and then executing it? This surely is going to be slow. And then, ECJ is already in java. So what would this step save. Symbolic regression can be made fast by opting for vector processing/evaluation by the interpreter. Much further improvements may be made by employing subtree caching. There is a paper by Maarten Keijzer that explains on this.
> Regards,
> Adil Raja
> ----- Original Message ----
> From: Ondrej Pacovsky <[log in to unmask]>
> To: [log in to unmask]
> Sent: Saturday, September 27, 2008 3:29:43 AM
> Subject: runtime complilation for expensive eval ?
> Hi,
> I was wondering whether someone tried converting the GP individual to
> java (or other) code (perhaps by the ECJ to Java converter) and
> compiling it before actually running the evaluation. This is of course
> quite slow, but for symbolic regression on many training values could be
> interesting. Thinking of 10^3 and more evals per individual per generation.
> -- Ondrej