<ul>
<li><p>Could someone provide a general estimate of the average (time) complexity of the LambdaMART learning-to-rank algorithm?</p>
</li>
<li><p>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?</p>
</li>
<li><p>Please, provide the necessary citations/sources on which the complexity estimation is based</p>
</li>
</ul>
<p>EDIT: Resources on LambdaRANK and LambdaMART</p>
<ul>
<li><a href="https://www.iro.umontreal.ca/%7Enie/IFT6255/Books/Learning-to-rank.pdf" rel="nofollow noreferrer">https://www.iro.umontreal.ca/~nie/IFT6255/Books/Learning-to-rank.pdf</a></li>
<li><a href="https://www.microsoft.com/en-us/research/uploads/prod/2016/02/MSR-TR-2010-82.pdf" rel="nofollow noreferrer">https://www.microsoft.com/en-us/research/uploads/prod/2016/02/MSR-TR-2010-82.pdf</a></li>
</ul>

CC BY-SA 4.0
2024-01-20T09:43:47.420Z
Welcome to Stack Exchange! If you add some links to  references defining LambdaMART, it will be easier to help you and answer your question!
J.y B.y
CC BY-SA 4.0
2024-01-20T13:21:39.567Z
Ok, I have edited the post
Enk9456
CC BY-SA 4.0
2024-01-20T21:15:36.853Z
Please don't use 'EDIT:'.  Instead, revise the question so it reads well for someone who encounters it for the first time.  See https://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.
D.W.
CC BY-SA 4.0
2024-01-20T21:15:51.233Z
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.
D.W.
<time-complexity><machine-learning>
Computational complexity of LambdaMART
Enk9456
# Computational complexity of LambdaMART

(Asked by: username_0 on 2024-01-12)

* 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

* [https://www.iro.umontreal.ca/~nie/IFT6255/Books/Learning-to-rank.pdf](https://www.iro.umontreal.ca/%7Enie/IFT6255/Books/Learning-to-rank.pdf)
* <https://www.microsoft.com/en-us/research/uploads/prod/2016/02/MSR-TR-2010-82.pdf>

**Tags:** time-complexity, machine-learning
> **Comments:**
> **username_1**: Welcome to Stack Exchange! If you add some links to  references defining LambdaMART, it will be easier to help you and answer your question!  
> **username_0**: Ok, I have edited the post  
> **username_2**: Please don't use 'EDIT:'.  Instead, revise the question so it reads well for someone who encounters it for the first time.  See https://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.  
> **username_2**: 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.  

---

## 0 answers

