Perturbs the current vector in a random direction. If it made the vector worse, restores the previous vector. Decays the deviation of perturbation over time.
|
| GAnnealing (GTargetFunction *pTargetFunc, GRand *pRand) |
|
virtual | ~GAnnealing () |
|
virtual const GVec & | currentVector () |
| Returns the best vector yet found. More...
|
|
virtual double | iterate () |
| Performs a little more optimization. (Call this in a loop until acceptable results are found.) More...
|
|
void | setDeviation (double d) |
| Specify the current deviation to use for annealing. (A random vector from a Normal distribution with the specified deviation will be added to each candidate vector in order to simulate annealing.) More...
|
|
| GOptimizer (GTargetFunction *pCritic) |
|
virtual | ~GOptimizer () |
|
void | basicTest (double minAccuracy, double warnRange=0.001) |
| This is a helper method used by the unit tests of several model learners. More...
|
|
double | searchUntil (size_t nBurnInIterations, size_t nIterations, double dImprovement) |
| This will first call iterate() nBurnInIterations times, then it will repeatedly call iterate() in blocks of nIterations times. If the error heuristic has not improved by the specified ratio after a block of iterations, it will stop. (For example, if the error before the block of iterations was 50, and the error after is 49, then training will stop if dImprovement is > 0.02.) If the error heuristic is not stable, then the value of nIterations should be large. More...
|
|