0
$\begingroup$
  • Could someone provide a general estimate of the average (time) complexity of the LambdaMART learning-to-rank algorithm?

  • A particular implementation of LambdaMART is known as XGBRanker. It uses XGBoosts as the underlying model to learn to predict relevance scores. Is it possible to derive a better estimate for this particular implementation?

  • Please, provide the necessary citations/sources on which the complexity estimation is based

EDIT: Resources on LambdaRANK and LambdaMART

$\endgroup$
4
  • $\begingroup$ Welcome to Stack Exchange! If you add some links to references defining LambdaMART, it will be easier to help you and answer your question! $\endgroup$
    – J..y B..y
    Jan 20 at 9:43
  • $\begingroup$ Ok, I have edited the post $\endgroup$
    – Enk9456
    Jan 20 at 13:21
  • 1
    $\begingroup$ Please don't use 'EDIT:'. Instead, revise the question so it reads well for someone who encounters it for the first time. See cs.meta.stackexchange.com/q/657/755. Please use a full citation/reference (title, authors, where published), not just a link to a PDF. We want the question to remain meaningful even if the link stops working, and we want others with a similar question about those papers to be able to find this by search. $\endgroup$
    – D.W.
    Jan 20 at 21:15
  • 1
    $\begingroup$ Please clarify your question. Running time as a function of which parameters? Please provide background. What have you come up with? Please show your progress. $\endgroup$
    – D.W.
    Jan 20 at 21:15

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.