Estimating the Hessian Matrix of Ranking Objectives for Stochastic Learning to Rank with Gradient Boosted Trees

arXiv:2404.12190 · cs.LG, cs.IR · Submitted 2024-04-18 · Read on arXiv

cs.LG, cs.IR

Submitted: 2024-04-18

Updated: 2024-05-09

Code: https://github.com/jkang98/2024-SIGIR-XGBoost-PL-Rank

Terminology

• Core — 3× in this paper · explained in 2 episodes
• Adam — 2× in this paper · explained in 2 episodes
• Benchmark — 1× in this paper · explained in 2 episodes
• Reward Function — 1× in this paper · explained in 2 episodes
• Sample Efficiency — 1× in this paper · explained in 4 episodes

Sources

• Introducing LETOR 4.0 Datasets

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks