PROMISE: process reward models for generative recommendation¶
Fidelity: core mechanism. Runs the defining mechanism verifiable on public data. Private data, production models, and serving remain outside scope.
Paper information¶
| Field | Details |
|---|---|
| Paper | arXiv 2601.04674 |
| Organization | Kuaishou Technology |
| First public release | 2026-01-08 (arXiv v1) |
| Authors' code | No public author code was found on 2026-09-05. |
| Adapter / method | promise |
| Local reproduction code | src/auto_research/reproductions/promise/ |
Original paper¶
Motivation and method¶
A lightweight path-level PRM evaluates intermediate paths at every SID level. It provides dense training feedback and prunes semantically drifting beams early at inference. Wider beams then give controllable test-time scaling.
flowchart LR
A["Public behavior and candidates"] --> B["PROMISE core mechanism"]
B --> C["Matched-budget method output"]
A --> D["Common direct baseline"]
C --> E["Full-catalog ranking and structural diagnostics"]
D --> E
Key figure from the paper¶
Figure 2: Core architecture, modules, and connections. From the original paper; copyright remains with the authors.
Core equations¶
Paper results¶
The paper reports a +5% production online core metric gain. This is paper evidence, not a local public-data outcome.
Local reproduction¶
Local comparison: Under the same full-catalog protocol, baseline NDCG@10 is 0.05401 and PROMISE NDCG@10 is 0.05929, +9.79% relative. The local proxy does not extrapolate to online lift.
See the three-seed artifact for complete results, means, standard deviations, and 95% confidence intervals.
Reproduction boundaries¶
The local run uses a fixed public MovieLens 100K subset and auditable proxies to validate the core computation. It does not reproduce private logs, production models, online traffic assignment, or serving. No claim is made to reproduce absolute paper metrics or online gains.
