Research map / Learning theory and algorithms / Prediction and decision losses
Are Neural Rankers still Outperformed by Gradient Boosted Decision Trees?
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Which Tricks are Important for Learning to Rank? (ICML 2023 · similarity 0.86)
- Supervised Score-Based Modeling by Gradient Boosting (AAAI 2025 · similarity 0.85)
- Gradient Regularized Newton Boosting Trees with Global Convergence (NeurIPS 2026 · similarity 0.84)
- Can Neural Networks Achieve Optimal Computational-statistical Tradeoff? An Analysis on Single-Index Model (ICLR 2025 · similarity 0.84)
- Where Do Large Learning Rates Lead Us? (NeurIPS 2024 · similarity 0.83)
- Low Rank Gradients and Where to Find Them (NeurIPS 2025 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.