All Stories

  1. Early Exit Strategies for Approximate k -NN Search in Dense Retrieval
  2. A Learning-to-Rank Formulation of Clustering-Based Approximate Nearest Neighbor Search
  3. Special Section on Efficiency in Neural Information Retrieval
  4. LambdaRank Gradients are Incoherent
  5. Can Embeddings Analysis Explain Large Language Model Ranking?
  6. On the Effect of Low-Ranked Documents: A New Sampling Function for Selective Gradient Boosting
  7. Filtering out Outliers in Learning to Rank
  8. ReNeuIR: Reaching Efficiency in Neural Information Retrieval
  9. ILMART: Interpretable Ranking with Constrained LambdaMART
  10. EiFFFeL
  11. A comparison of spatio-temporal prediction methods
  12. Learning Early Exit Strategies for Additive Ranking Ensembles
  13. Adaptive attacks on machine learning models
  14. Query-level Early Exit for Additive Learning-to-Rank Ensembles
  15. Adversarial Training of Gradient-Boosted Decision Trees
  16. Learning to Rank in Theory and Practice
  17. X-CLE a VER
  18. Efficient and Effective Query Expansion for Web Search
  19. Continuation Methods and Curriculum Learning for Learning to Rank
  20. Selective Gradient Boosting for Effective Learning to Rank
  21. Do Violent People Smile