A new listwise learning-to-rank method uses smooth rank approximation and boosting to optimize without depending on a single metric.
A general approximation framework for direct optimization of information retrieval measures
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Metric-agnostic Learning-to-Rank via Boosting and Rank Approximation
A new listwise learning-to-rank method uses smooth rank approximation and boosting to optimize without depending on a single metric.