From c2d46ce8b337eb84da903a5e1760cc7f06380284 Mon Sep 17 00:00:00 2001
From: Richard Roberts <richard.jw.roberts@gmail.com>
Date: Sat, 21 Aug 2010 17:54:59 +0000
Subject: [PATCH] Script to time the overhead of breaking up a problem into
 many factors (mimics a linear latent-variable model)

---
 tests/Makefile.am            |   2 +-
 tests/timeFactorOverhead.cpp | 137 +++++++++++++++++++++++++++++++++++
 2 files changed, 138 insertions(+), 1 deletion(-)
 create mode 100644 tests/timeFactorOverhead.cpp

diff --git a/tests/Makefile.am b/tests/Makefile.am
index 401a247a8..17070bcb4 100644
--- a/tests/Makefile.am
+++ b/tests/Makefile.am
@@ -25,7 +25,7 @@ check_PROGRAMS += testConstraintOptimizer
 endif
 
 # Timing tests
-noinst_PROGRAMS = timeGaussianFactorGraph
+noinst_PROGRAMS = timeGaussianFactorGraph timeFactorOverhead
 
 #----------------------------------------------------------------------------------------------------
 # rules to build unit tests
diff --git a/tests/timeFactorOverhead.cpp b/tests/timeFactorOverhead.cpp
new file mode 100644
index 000000000..68b215deb
--- /dev/null
+++ b/tests/timeFactorOverhead.cpp
@@ -0,0 +1,137 @@
+/**
+ * @file    timeFactorOverhead.cpp
+ * @brief   Compares times of solving large single-factor graphs with their multi-factor equivalents.
+ * @author  Richard Roberts
+ * @created Aug 20, 2010
+ */
+
+#include <gtsam/linear/GaussianFactorGraph.h>
+#include <gtsam/linear/SharedDiagonal.h>
+#include <gtsam/inference/Ordering.h>
+
+#include <boost/random.hpp>
+#include <boost/timer.hpp>
+#include <vector>
+
+using namespace gtsam;
+using namespace std;
+
+static boost::variate_generator<boost::mt19937, boost::uniform_real<> > rg(boost::mt19937(), boost::uniform_real<>(0.0, 1.0));
+
+int main(int argc, char *argv[]) {
+
+  Symbol key('x', 0);
+
+  size_t vardim = 2;
+  size_t blockdim = 1;
+  size_t nBlocks = 2000;
+
+  size_t nTrials = 500;
+
+  double blockbuild, blocksolve, combbuild, combsolve;
+
+  cout << "\n1 variable of dimension " << vardim << ", " <<
+      nBlocks << " blocks of dimension " << blockdim << "\n";
+  cout << nTrials << " trials\n";
+
+  /////////////////////////////////////////////////////////////////////////////
+  // Timing test with blockwise Gaussian factor graphs
+
+  {
+    // Build GFG's
+    cout << "Building blockwise Gaussian factor graphs... ";
+    cout.flush();
+    boost::timer timer;
+    timer.restart();
+    vector<GaussianFactorGraph> blockGfgs;
+    blockGfgs.reserve(nTrials);
+    for(size_t trial=0; trial<nTrials; ++trial) {
+      blockGfgs.push_back(GaussianFactorGraph());
+      SharedDiagonal noise = sharedSigma(blockdim, 1.0);
+      for(size_t i=0; i<nBlocks; ++i) {
+        // Generate a random Gaussian factor
+        Matrix A(blockdim, vardim);
+        for(size_t j=0; j<blockdim; ++j)
+          for(size_t k=0; k<vardim; ++k)
+            A(j,k) = rg();
+        Vector b(blockdim);
+        for(size_t j=0; j<blockdim; ++j)
+          b(j) = rg();
+        blockGfgs[trial].push_back(GaussianFactor::shared_ptr(new GaussianFactor(key, A, b, noise)));
+      }
+    }
+    blockbuild = timer.elapsed();
+    cout << blockbuild << " s" << endl;
+
+    // Solve GFG's
+    cout << "Solving blockwise Gaussian factor graphs... ";
+    cout.flush();
+    timer.restart();
+    for(size_t trial=0; trial<nTrials; ++trial) {
+      VectorMap soln(blockGfgs[trial].optimize(blockGfgs[trial].getOrdering()));
+    }
+    blocksolve = timer.elapsed();
+    cout << blocksolve << " s" << endl;
+  }
+
+
+  /////////////////////////////////////////////////////////////////////////////
+  // Timing test with combined-factor Gaussian factor graphs
+
+  {
+    // Build GFG's
+    cout << "Building combined-factor Gaussian factor graphs... ";
+    cout.flush();
+    boost::timer timer;
+    timer.restart();
+    vector<GaussianFactorGraph> combGfgs;
+    for(size_t trial=0; trial<nTrials; ++trial) {
+      combGfgs.push_back(GaussianFactorGraph());
+      SharedDiagonal noise = sharedSigma(blockdim, 1.0);
+
+      Matrix Acomb(blockdim*nBlocks, vardim);
+      Vector bcomb(blockdim*nBlocks);
+      for(size_t i=0; i<nBlocks; ++i) {
+        // Generate a random Gaussian factor
+        for(size_t j=0; j<blockdim; ++j)
+          for(size_t k=0; k<vardim; ++k)
+            Acomb(blockdim*i+j, k) = rg();
+        Vector b(blockdim);
+        for(size_t j=0; j<blockdim; ++j)
+          bcomb(blockdim*i+j) = rg();
+      }
+      combGfgs[trial].push_back(GaussianFactor::shared_ptr(new GaussianFactor(key, Acomb, bcomb,
+          sharedSigma(blockdim*nBlocks, 1.0))));
+    }
+    combbuild = timer.elapsed();
+    cout << combbuild << " s" << endl;
+
+    // Solve GFG's
+    cout << "Solving combined-factor Gaussian factor graphs... ";
+    cout.flush();
+    timer.restart();
+    for(size_t trial=0; trial<nTrials; ++trial) {
+      VectorMap soln(combGfgs[trial].optimize(combGfgs[trial].getOrdering()));
+    }
+    combsolve = timer.elapsed();
+    cout << combsolve << " s" << endl;
+  }
+
+  /////////////////////////////////////////////////////////////////////////////
+  // Print per-graph times
+  cout << "\nPer-factor-graph times for building and solving\n";
+  cout << "Blockwise:  total " << ((blockbuild+blocksolve)/double(nTrials)) <<
+      "  build " << (blockbuild/double(nTrials)) <<
+      "  solve " << (blocksolve/double(nTrials)) << " s/graph\n";
+  cout << "Combined:   total " << ((combbuild+combsolve)/double(nTrials)) <<
+      "  build " << (combbuild/double(nTrials)) <<
+      "  solve " << (combsolve/double(nTrials)) << " s/graph\n";
+  cout << "Fraction of time spent in overhead\n" <<
+      "  total " << (((blockbuild+blocksolve)-(combbuild+combsolve)) / (blockbuild+blocksolve)) << "\n" <<
+      "  build " << ((blockbuild-combbuild) / blockbuild) << "\n" <<
+      "  solve " << ((blocksolve-combsolve) / blocksolve) << "\n";
+  cout << endl;
+
+  return 0;
+}
+