Created
July 11, 2017 21:53
-
-
Save shikharbhardwaj/91fe7e5984f32ccd95b78c99c9fcbf20 to your computer and use it in GitHub Desktop.
Sample test for sparse matrix completion
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <mlpack/core.hpp> | |
#include <mlpack/core/optimizers/parallel_sgd/parallel_sgd.hpp> | |
#include <mlpack/core/optimizers/parallel_sgd/decay_policies/constant_step.hpp> | |
#include <mlpack/core/optimizers/parallel_sgd/sparse_mc_function.hpp> | |
using namespace std; | |
using namespace mlpack; | |
using namespace mlpack::optimization; | |
int main() | |
{ | |
arma::mat X, values; | |
arma::umat indices; | |
mlpack::data::Load("./completion_X.csv", X, true, false); | |
mlpack::data::Load("./completion_indices.csv", indices, true, false); | |
values.set_size(indices.n_cols); | |
for(size_t i = 0; i < indices.n_cols; ++i) | |
{ | |
values(i) = X(indices(0, i), indices(1, i)); | |
} | |
size_t rank = 6; | |
SparseMCLossFunction f(arma::trans(indices.row(0)), | |
arma::trans(indices.row(1)), values, 0.001, rank); | |
ConstantStep decayPolicy(0.4); | |
ParallelSGD<ConstantStep> s(0, f.NumFunctions() / 4, 1e-10, decayPolicy); | |
arma::mat iterate(rank, X.n_cols + X.n_rows, arma::fill::randu); | |
auto final = s.Optimize(f, iterate); | |
std::cout << "Final : " << final << endl; | |
arma::mat recovered = f.Recover(iterate); | |
std::cout << "Err : "<< arma::norm(X - recovered, "fro") / arma::norm(X, "fro") << std::endl; | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Final : 0.0197419 | |
Err : 0.00129987 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment