Re-ranking Based Diversification: A Unifying View

June 26, 2019 Β· Declared Dead Β· πŸ› International Conference on the Theory of Information Retrieval

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Shameem A Puthiya Parambath arXiv ID 1906.11285 Category cs.IR: Information Retrieval Cross-listed stat.ML Citations 1 Venue International Conference on the Theory of Information Retrieval Last Checked 4 months ago
Abstract
We analyze different re-ranking algorithms for diversification and show that majority of them are based on maximizing submodular/modular functions from the class of parameterized concave/linear over modular functions. We study the optimality of such algorithms in terms of the `total curvature'. We also show that by adjusting the hyperparameter of the concave/linear composition to trade-off relevance and diversity, if any, one is in fact tuning the `total curvature' of the function for relevance-diversity trade-off.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Retrieval

Died the same way β€” πŸ‘» Ghosted