-
Notifications
You must be signed in to change notification settings - Fork 1.9k
Fix matrix factorization trainer's doc based on user feedback #3170
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Conversation
Codecov Report
@@ Coverage Diff @@
## master #3170 +/- ##
=========================================
Coverage ? 72.53%
=========================================
Files ? 807
Lines ? 144774
Branches ? 16208
=========================================
Hits ? 105016
Misses ? 35344
Partials ? 4414
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
To avoid this kind of issues in the future, it might be good to include the code sample that you are giving here in the referenced sample file instead of the trainer's doc. Refers to: src/Microsoft.ML.Recommender/MatrixFactorizationTrainer.cs:50 in 95f09fd. [](commit_id = 95f09fd, deletion_comment = False) |
/// // Matrix row index starts from firstRowIndex and is at most firstRowIndex+m-1. | ||
/// // Contieuous=true means that all values from firstRowIndex to firstRowIndex+m-1 are allowed keys. | ||
/// [KeyType(Contiguous = true, Count = m, Min = firstRowIndex)] | ||
/// // Matrix column index starts from 0 and is at most n-1. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
// Matrix column index starts from 0 and is at most n-1. [](start = 12, length = 56)
tangential, what do you think about #3072
@@ -65,7 +60,7 @@ namespace Microsoft.ML.Trainers | |||
/// <i>R</i> is approximated by the product of <i>P</i>'s transpose and <i>Q</i>. This trainer implements | |||
/// <a href='https://www.csie.ntu.edu.tw/~cjlin/papers/libmf/mf_adaptive_pakdd.pdf'>a stochastic gradient method</a> for finding <i>P</i> | |||
/// and <i>Q</i> via minimizing the distance between<i> R</i> and the product of <i>P</i>'s transpose and Q.</para>. | |||
/// <para>For users interested in the mathematical details, please see the references below.</para> | |||
/// <para>The underlying library used in ML.NET matrix factorization can be found on <a href='https://github.com/cjlin1/libmf'>a Github repository</a>. For users interested in the mathematical details, please see the references below.</para> |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
on a Github repository [](start = 86, length = 68)
on the libmf Github repository
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
This PR fixes #3169 by