diff --git a/gtsam_unstable/linear/tests/testLPSolver.cpp b/gtsam_unstable/linear/tests/testLPSolver.cpp
index 8bf6be56b..a105a39f0 100644
--- a/gtsam_unstable/linear/tests/testLPSolver.cpp
+++ b/gtsam_unstable/linear/tests/testLPSolver.cpp
@@ -189,12 +189,12 @@ TEST(LPSolver, overConstrainedLinearSystem) {
 
 TEST(LPSolver, overConstrainedLinearSystem2) {
   GaussianFactorGraph graph;
-  graph.push_back(JacobianFactor(1, I_1x1, 2, I_1x1, kOne,
-                                 noiseModel::Constrained::All(1)));
-  graph.push_back(JacobianFactor(1, I_1x1, 2, -I_1x1, 5 * kOne,
-                                 noiseModel::Constrained::All(1)));
-  graph.push_back(JacobianFactor(1, I_1x1, 2, 2 * I_1x1, 6 * kOne,
-                                 noiseModel::Constrained::All(1)));
+  graph.emplace_shared<JacobianFactor>(1, I_1x1, 2, I_1x1, kOne,
+                                 noiseModel::Constrained::All(1));
+  graph.emplace_shared<JacobianFactor>(1, I_1x1, 2, -I_1x1, 5 * kOne,
+                                 noiseModel::Constrained::All(1));
+  graph.emplace_shared<JacobianFactor>(1, I_1x1, 2, 2 * I_1x1, 6 * kOne,
+                                 noiseModel::Constrained::All(1));
   VectorValues x = graph.optimize();
   // This check confirms that gtsam linear constraint solver can't handle
   // over-constrained system
diff --git a/gtsam_unstable/nonlinear/tests/testConcurrentIncrementalSmootherGN.cpp b/gtsam_unstable/nonlinear/tests/testConcurrentIncrementalSmootherGN.cpp
index 65f74dc3c..fdf9f08b5 100644
--- a/gtsam_unstable/nonlinear/tests/testConcurrentIncrementalSmootherGN.cpp
+++ b/gtsam_unstable/nonlinear/tests/testConcurrentIncrementalSmootherGN.cpp
@@ -639,13 +639,13 @@ TEST( ConcurrentIncrementalSmoother, removeFactors_topology_1 )
   actualGraph.print("actual graph:  \n");
 
   NonlinearFactorGraph expectedGraph;
-  expectedGraph.push_back(PriorFactor<Pose3>(1, poseInitial, noisePrior));
+  expectedGraph.emplace_shared<PriorFactor<Pose3> >(1, poseInitial, noisePrior);
   // we removed this one: expectedGraph.push_back(BetweenFactor<Pose3>(1, 2, poseOdometry, noiseOdometery));
   // we should add an empty one, so that the ordering and labeling of the factors is preserved
   expectedGraph.push_back(NonlinearFactor::shared_ptr());
-  expectedGraph.push_back(BetweenFactor<Pose3>(2, 3, poseOdometry, noiseOdometery));
-  expectedGraph.push_back(BetweenFactor<Pose3>(3, 4, poseOdometry, noiseOdometery));
-  expectedGraph.push_back(BetweenFactor<Pose3>(1, 2, poseOdometry, noiseOdometery));
+  expectedGraph.emplace_shared<BetweenFactor<Pose3> >(2, 3, poseOdometry, noiseOdometery);
+  expectedGraph.emplace_shared<BetweenFactor<Pose3> >(3, 4, poseOdometry, noiseOdometery);
+  expectedGraph.emplace_shared<BetweenFactor<Pose3> >(1, 2, poseOdometry, noiseOdometery);
 
 //  CHECK(assert_equal(expectedGraph, actualGraph, 1e-6));
 }