aiqbench analysis
This paper advances slate recommendation systems by establishing formal differential-privacy guarantees that persist through deterministic selection processes. It further introduces a logged margin certificate to mathematically certify stability against score noise, ensuring ordered slates remain unchanged under bounded objective movement. These contributions provide rigorous frameworks for privacy-preserving and stable ranking in noisy environments without claiming universal utility improvements.
Decoupled Learning and Selection in Slate Recommendation for Privacy and Stability Under Noisy Scores
arXiv:2609.29453v1 Announce Type: new Abstract: We formalize slate recommendation as a randomized score learner followed by deterministic selection. First, an appropriately scoped differential-privacy guarantee passes through selection and its audit trace by post-processing. End-to-end privacy holds only when selector inputs are public or independent, previous private outputs, or separately privacy-accounted; fixing raw state or candidate information instead yields only a conditional guarantee. Second, we derive a logged margin certificate: bounded score-induced objective movement below half the smallest greedy decision margin guarantees that the ordered slate is unchanged. Controlled fixed-margin tests show near-linear exponent scaling, with an empirical slope of $-0.220$ (95% CI $[-0.231,-0.210]$) against the independent-noise reference $-1/4$. Real-anchor experiments on OULAD, MovieLens-25M, and Amazon Musical Instruments show that greater anchor weight reduces score-noise-induced ranking churn. OULAD and EdNet certificate checks validate the implementation of the logged inequality, while closed-loop simulations show bounded target drift and setting-dependent downstream utility. The contribution is therefore a privacy-scope contract and a certifiable score-to-slate stability mechanism, not a universal utility claim.
Abstract:We formalize slate recommendation as a randomized score learner followed by deterministic selection. First, an appropriately scoped differential-privacy guarantee passes through selection and its audit trace by post-processing. End-to-end privacy holds only when selector inputs are public or independent, previous private outputs, or separately privacy-accounted; fixing raw state or candidate information instead yields only a conditional guarantee. Second, we derive a logged margin certificate: bounded score-induced objective movement below half the smallest greedy decision margin guarantees that the ordered slate is unchanged. Controlled fixed-margin tests show near-linear exponent scaling, with an empirical slope of $-0.220$ (95% CI $[-0.231,-0.210]$) against the independent-noise reference $-1/4$. Real-anchor experiments on OULAD, MovieLens-25M, and Amazon Musical Instruments show that greater anchor weight reduces score-noise-induced ranking churn. OULAD and EdNet certificate checks validate the implementation of the logged inequality, while closed-loop simulations show bounded target drift and setting-dependent downstream utility. The contribution is therefore a privacy-scope contract and a certifiable score-to-slate stability mechanism, not a universal utility claim.
20 pages including supplementary appendix. Accepted at ACM RecSys 2026
Machine Learning (cs.LG); Information Retrieval (cs.IR)
arXiv:2609.29453 [cs.LG]
(or arXiv:2609.29453v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2609.29453 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
https://doi.org/10.1145/3773078.3831836 Focus to learn more DOI(s) linking to related resources
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 279 words
Related coverage
Edge of Stability Selectively Shapes Learning Across the Data Distribution
arXiv · Jun 10, 2026
Edge of Stability Selectively Shapes Learning Across the Data Distribution
arXiv · Jun 5, 2026
Stale but Stable: Staleness-Adaptive Trust Regions for Stabilizing Asynchronous Reinforcement Learning
arXiv · Jul 22, 2026
Hierarchical Projection for Adaptive Knowledge Transfer
arXiv · Jun 9, 2026