Is it possible to use advance optimization(L-BFGS, Conjugate gradient) for a collaborative filtering system vs just using gradient descent? I ask this because of the need to calculate both X and theta simutaneously.
$\begingroup$
$\endgroup$
Add a comment
|
3 Answers
$\begingroup$
$\endgroup$
L-BFGS, Conjugate gradient and SGD can solve unconstrained optimization problems.
You can find a low-rank approximation with any of those methods.
$\begingroup$
$\endgroup$
Recent work on using conjugate gradient and graph side information for matrix factorisation with clear example and code.
Here you can see how to represent the MF problem, with graph side information, in a correct form (Sylvester equation) and solve with CG https://papers.nips.cc/paper/5938-collaborative-filtering-with-graph-information-consistency-and-scalable-methods
code avaliable here https://github.com/rofuyu/exp-grmf-nips15
$\begingroup$
$\endgroup$
Absolutely, see my example in - http://sanealytics.com/2015/03/10/matrix-factorization/
You can substitute for your favorite optimization method.
