[mlpack-git] master: The failure probability is already small, but not small enough it seems. (5484cf7)

[gitdub at big.cc.gt.atl.ga.us]

Repository : https://github.com/mlpack/mlpack

On branch  : master
Link       : https://github.com/mlpack/mlpack/compare/904762495c039e345beba14c1142fd719b3bd50e...f94823c800ad6f7266995c700b1b630d5ffdcf40

>---------------------------------------------------------------

commit 5484cf73e8492346e20a184b2f55e452ba5623d8
Author: Ryan Curtin <ryan at ratml.org>
Date:   Wed Dec 10 15:33:43 2014 +0000

    The failure probability is already small, but not small enough it seems.


>---------------------------------------------------------------

5484cf73e8492346e20a184b2f55e452ba5623d8
 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 0734aa7..140c924 100644
--- a/src/mlpack/tests/sa_test.cpp
+++ b/src/mlpack/tests/sa_test.cpp
@@ -102,11 +102,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);