[mlpack-git] mlpack-1.0.x: Merge RastrigrinFunction test failure probability relaxation from trunk. (cae389a)
gitdub at big.cc.gt.atl.ga.us
gitdub at big.cc.gt.atl.ga.us
Wed Jan 7 11:58:29 EST 2015
Repository : https://github.com/mlpack/mlpack
On branch : mlpack-1.0.x
Link : https://github.com/mlpack/mlpack/compare/0000000000000000000000000000000000000000...904762495c039e345beba14c1142fd719b3bd50e
>---------------------------------------------------------------
commit cae389a87337a4c7080f60af874c5892a07e55cb
Author: Ryan Curtin <ryan at ratml.org>
Date: Wed Dec 10 15:35:02 2014 +0000
Merge RastrigrinFunction test failure probability relaxation from trunk.
>---------------------------------------------------------------
cae389a87337a4c7080f60af874c5892a07e55cb
src/mlpack/tests/sa_test.cpp | 4 ++--
1 file changed, 2 insertions(+), 2 deletions(-)
diff --git a/src/mlpack/tests/sa_test.cpp b/src/mlpack/tests/sa_test.cpp
index e349fcd..bd4fd9a 100644
--- a/src/mlpack/tests/sa_test.cpp
+++ b/src/mlpack/tests/sa_test.cpp
@@ -117,11 +117,11 @@ class RastrigrinFunction
BOOST_AUTO_TEST_CASE(RastrigrinFunctionTest)
{
// Simulated annealing isn't guaranteed to converge (except in very specific
- // situations). If this works 1 of 4 times, I'm fine with that. All I want
+ // situations). If this works 1 of 5 times, I'm fine with that. All I want
// to know is that this implementation will escape from local minima.
size_t successes = 0;
- for (size_t trial = 0; trial < 4; ++trial)
+ for (size_t trial = 0; trial < 5; ++trial)
{
RastrigrinFunction f;
ExponentialSchedule schedule(3e-6);
More information about the mlpack-git
mailing list