listwise ranking

**Listwise ranking** optimizes **the entire ranked list** — directly optimizing ranking metrics like NDCG or MAP rather than individual scores or pairs, the most sophisticated learning to rank approach. **What Is Listwise Ranking?** - **Definition**: Optimize entire ranked list directly. - **Training**: Minimize loss on complete ranked lists. - **Goal**: Directly optimize ranking evaluation metrics. **How It Works** **1. Input**: Query + candidate items. **2. Model**: Predict scores or permutation for all items. **3. Loss**: Compute loss on entire ranked list (e.g., NDCG loss). **4. Optimize**: Gradient descent to minimize list-level loss. **Advantages** - **Direct Optimization**: Optimize actual ranking metrics (NDCG, MAP). - **List Context**: Consider position, other items in list. - **Theoretically Optimal**: Directly targets ranking objective. **Disadvantages** - **Complexity**: More complex than pointwise/pairwise. - **Computational Cost**: Expensive to compute list-level gradients. - **Non-Differentiable**: Ranking metrics often non-differentiable (need approximations). **Algorithms**: ListNet, ListMLE, LambdaMART, AdaRank, SoftRank. **Loss Functions**: ListNet loss (cross-entropy on permutations), ListMLE (likelihood of correct permutation), NDCG loss (approximated). **Applications**: Search engines, recommender systems, any application where list quality matters. **Evaluation**: NDCG, MAP, MRR (directly optimized metrics). Listwise ranking is **the most sophisticated LTR approach** — by directly optimizing ranking metrics, listwise methods achieve best ranking quality, though at higher computational cost and complexity.