convert example.cpp into polyapprox.cpp - made it a bit more of a generic polynomial approximator program
tweaked default range in DE::Engine
This commit is contained in:
1 parent
76f95a74b9
commit
eedade5b63
3 files changed
+82
-45
No files matched your search
@@ -0,0 +1,81 @@
|
||||
#include <cstdio>
|
||||
#include <cmath>
|
||||
|
||||
#include "de.h"
|
||||
|
||||
// the order of the polynomial (actually the number of coefficients, i.e. 1 = constant, 2 = line, etc.)
|
||||
#define NUM_COEFFICIENTS 3
|
||||
|
||||
// the function we're searching for
|
||||
double TargetFunction(double x)
|
||||
{
|
||||
//return 1.0 / (1.0 + exp(-4.9*x)); // Ken Stanley's NEAT activation
|
||||
//return (1.0 / (1.0 + exp(-4.9*x)) - 0.5) * 2.0; // " " (signed version)
|
||||
//return (1.0 / (1.0 + exp(-x)) - 0.5) * 2.0; // signed sigmoid
|
||||
//return exp(-x*x); // gaussian
|
||||
//return tanh(x); // tanh
|
||||
//return (2.0/(1.0+exp(-x))-1.0); // tanh approximation
|
||||
return (x<0.0 ? -1.0 : 1.0) * sqrt(abs(x)); // signed root
|
||||
}
|
||||
|
||||
|
||||
// a helper function used in calculating the polynomials
|
||||
double CalculatePolynomial(double x, int n_coeffs, const double coeffs[])
|
||||
{
|
||||
double accum = 0.0;
|
||||
double xmul = 1.0;
|
||||
for (int i = n_coeffs-1; i>=0; --i)
|
||||
{
|
||||
accum += xmul * coeffs[i];
|
||||
xmul *= x;
|
||||
}
|
||||
return accum;
|
||||
}
|
||||
|
||||
|
||||
// our DE implementation
|
||||
class PolySearch: public DE::Engine<NUM_COEFFICIENTS>
|
||||
{
|
||||
public:
|
||||
// this method is called by the DE::Engine::Solve() to test a single DE individual
|
||||
double CalculateError(const double testcase[NUM_COEFFICIENTS], bool& stop)
|
||||
{
|
||||
double error = 0.0;
|
||||
unsigned int test_count = 0;
|
||||
|
||||
// accumulate squared error
|
||||
for ( double i=-1.5;i<=1.5;i+=0.01 )
|
||||
{
|
||||
// test
|
||||
double test = CalculatePolynomial(i,NUM_COEFFICIENTS,testcase);
|
||||
double actual = TargetFunction(i);
|
||||
|
||||
// accumulate error^2
|
||||
error += (test-actual)*(test-actual);
|
||||
|
||||
// inc test count (divisor to get from SE to MSE)
|
||||
test_count++;
|
||||
}
|
||||
|
||||
// convert SE to RMSE
|
||||
error = sqrt(error / (double)test_count);
|
||||
|
||||
// set stop flag if the error is really low
|
||||
if ( error < 0.0000001 )
|
||||
{
|
||||
stop = true;
|
||||
}
|
||||
|
||||
// done
|
||||
return error;
|
||||
}
|
||||
};
|
||||
|
||||
|
||||
// main program
|
||||
int main()
|
||||
{
|
||||
PolySearch de;
|
||||
de.Solve(1000);
|
||||
return 0;
|
||||
}
|
||||
Reference in new issue
Block a user