[mlpack] 141/149: The failure probability is already small, but not small enough it seems.

Barak A. Pearlmutter barak+git at pearlmutter.net
Sat May 2 09:11:19 UTC 2015


This is an automated email from the git hooks/post-receive script.

bap pushed a commit to branch svn-trunk
in repository mlpack.

commit 0aca8721b5331005341ee489283454ca2186d84d
Author: rcurtin <rcurtin at 9d5b8971-822b-0410-80eb-d18c1038ef23>
Date:   Wed Dec 10 15:33:43 2014 +0000

    The failure probability is already small, but not small enough it seems.
    
    
    git-svn-id: http://svn.cc.gatech.edu/fastlab/mlpack/trunk@17489 9d5b8971-822b-0410-80eb-d18c1038ef23
---
 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);

-- 
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/debian-science/packages/mlpack.git



More information about the debian-science-commits mailing list