atlas

Research map / Reinforcement learning / RL from feedback

Objective Shaping with Hard Negatives: Windowed Partial AUC Optimization for RL-based LLM Recommenders

NeurIPS 2026 · Reinforcement learning › RL from feedback · approach: RL for LLM reasoning · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Shows that GRPO with binary rewards optimizes AUC, beam-search negatives shift it toward one-way partial AUC, and proposes windowed partial AUC (WPAUC) with a soft threshold-adjusted reweighting (TAWin) for RL-trained LLM recommenders.

Problem

RL training of LLM-based recommenders benefits from beam-search negatives over random negatives, but the mechanism behind this and how it aligns with Top-K recommendation metrics is not well understood.

Approach

Views GRPO with binary reward as pairwise AUC maximization, shows hard beam-search negatives induce OPAUC, and generalizes to a windowed partial AUC over an FPR interval [alpha, alpha+d]; TAWin implements the window via a soft threshold-adjusted Top-K reweighting of negative advantages.

Key results

Surprising findings

Limitations

Experimental setup

Datasets: Amazon Toys and Games Amazon Industrial and Scientific Amazon Office Products Yelp

Benchmarks: Amazon Toys Amazon Industrial Amazon Office Yelp

Metrics: Recall@K NDCG@K

Baselines: GRU4Rec Caser SASRec TIGER LC-Rec MiniOneRec BigRec D3 S-DPO ReRe

Builds on: GRPO one-way partial AUC soft top-k operator

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy