Papers for

online retail teams

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Dynamic clustering keeps centers updated fast with limited changes

Dynamic $k$-Median with Worst-Case Update Time and Recourse

Abstract: We study fully dynamic metric $k$-median under unit-weight client insertions and deletions. After each update, the algorithm must maintain at most $k$ centers chosen from the current client locations. We give a randomized constant-factor approximation algorithm with $\widetilde O(k)$ worst-case update time and $O((1+\logΔ)^3)$ worst-case center recourse, where $Δ$ is the aspect ratio of the underlying metric space. The approximation guarantee holds simultaneously over any prescribed finite adaptive update sequence with high probability, while the update time and recourse bounds hold on every execution. We also obtain the same asymptotic guarantees for metric $k$-means.

Thu 12 NovData Structures and Algorithms
The gist
The paper looks at how to quickly update group centers when points are added or removed from a space, like choosing store locations as customers come and go. The authors create a method that always keeps the number of centers small and close to optimal, while making only a few center changes each time. Their approach works reliably for any sequence of updates and runs efficiently even in the worst cases. They also adapt their method to a related grouping problem called k-means.
Open → 2611.17296v1

TimeWorld improves forecasting by modeling action effects on time series

TimeWorld: Towards Action-Conditioned Multimodal World Models for Time Series Forecasting

Abstract: Time series forecasting supports decision-making in web applications such as online retail and network management, where planned actions can reshape future dynamics. World models provide a natural paradigm for predicting such action-dependent changes beyond extrapolating historical patterns. However, existing time series world models (TSWMs) typically rely on fixed, domain-specific covariate schemas that limit flexible intervention specification, while multimodal forecasters treat text primarily as passive predictive context. To investigate these gaps, we introduce TSWM-Bench, a cross-domain benchmark for multimodal TSWMs spanning seven real-world datasets, with textual interventions grounded in recorded action--outcome data. Our evaluation reveals that conventional multimodal forecasters underperform history-only time series foundation models (TSFMs) despite dataset-specific training, whereas simple text-prefix adaptations improve forecasting across all evaluated TSFM backbones. These findings suggest that pretrained TSFMs encode implicit world knowledge of temporal dynamics, offering a strong foundation for action-conditioned modeling beyond conventional multimodal fusion. Building on this insight, we propose TimeWorld, a plug-in framework that adapts pretrained TSFMs through explicit action-response modeling. Specifically, the Prototype-Guided Latent Modulation (PLM) module grounds textual actions in temporal dynamics by composing representative response prototypes to modulate future representations based on the action and historical patterns. The Action Contrastive Learning (ACL) component strengthens action-specific response modeling by contrasting these updates under alternative interventions sharing the same history, distinguishing action types while preserving relative intensity relationships.

Mon 26 OctMachine Learning
The gist
Predicting what will happen next is hard when actions change the future, like sales promotions affecting retail demand. The authors found that existing models struggle to account for actions described in text when forecasting time-dependent events. They made a new test set and showed that adapting large pretrained models to better understand these actions improves predictions. They then created TimeWorld, a method that links actions to how they change future events, helping models forecast more accurately when actions occur.
Open → 2610.34797v1

Personal agent improves recommendations using cross platform user history

Personal-Agent Mediated Recommendation with Cross-Platform User History

Abstract: Modern recommendation is shifting from platform-centric personalization toward user-governed personalization, where a personal LLM agent can act on the user's behalf across services. We formalize this emerging paradigm as Personal-Agent Mediated Recommendation: a platform recommender ranks a candidate set using platform-local information, and a personal agent uses user-authorized cross-platform history to mediate the resulting ranking and produce the final top-K slate. Such mediation is nontrivial: the platform ranking can encode strong population evidence that the personal agent cannot observe, so effective mediation must therefore balance beneficial rescues against harmful overrides. To study this trade-off, we introduce MediateRec, a benchmark that includes scalable proxy cross-platform environments and a real cross-platform test under a controlled platform-agent information boundary. To train the agent to use cross-platform history effectively, we further propose Personal Attribution Mediation Optimization (PAMO), which counterfactually masks that history to estimate personal mediation support and reallocates rank-aware advantage mass under a platform-relative value floor. We theoretically prove that PAMO preserves cutoff-level advantage mass and is locally optimal among first-order reallocations that preserve this mass without lowering average platform-relative value. Experiments on MediateRec show that personal-agent mediation enables meaningful platform corrections, yet even strong proprietary LLMs introduce non-negligible harmful overrides. PAMO consistently improves over matched outcome-only RL across seen and unseen target platforms and on the real cross-platform test, while achieving a better rescue-harm balance.

Tue 6 OctArtificial IntelligenceMachine Learning
The gist
Recommendation systems usually suggest items based only on activity within one website or app. This paper explores using a personal AI assistant that can combine your activity across different platforms to make better recommendations. The challenge is balancing this cross-platform input with the original system's suggestions to avoid harmful changes. The authors propose a new method, PAMO, to train these agents to improve recommendations while minimizing mistakes. They test their approach on simulated and real data, showing it improves results compared to other methods.
Open → 2610.07588v1

Sign aware recommender systems need better evaluation metrics

What Gets Measured Gets Managed: Sign-aware Recommendation Needs Sign-aware Evaluation

Abstract: Sign-aware recommender systems have recently been developed to leverage negative feedback for a deeper understanding of user preferences. However, our empirical diagnosis reveals that state-of-the-art graph-based sign-aware recommender systems are paradoxically valence-blind. Even though they explicitly incorporate sign information during training, they consistently fail to differentiate liked items from disliked ones at the ranking stage, frequently infiltrating top-K recommendations with disliked content. Through linear probing, we show that while valence information exists in the learned embeddings, it remains inaccessible to the inner-product scoring function. This widespread failure remains entirely undetected because conventional evaluation metrics, such as Recall, HR, and NDCG, assign a uniform utility of zero to both negative and unobserved items, creating a systematic evaluation blind spot. To bridge this gap, we propose a family of signed metrics, Signed Recall, Signed HR, and Signed NDCG, that explicitly penalize the recommendation of disliked content. Systematic re-evaluation under our proposed metrics fundamentally reshapes the established performance landscape, revealing that methods ranked highly under conventional metrics often fail to protect users from disliked content. Finally, through a proof-of-concept auxiliary loss, we confirm that the proposed metrics provide actionable training signals, guiding models toward valence-aware behavior without sacrificing conventional relevance. For transparency, our source code is available at: https://anonymous.4open.science/r/signed-rec-benchmark-07E4

Sun 27 SeptInformation Retrieval
The gist
Many recommendation systems try to guess what you like, but some also use what you dislike to improve suggestions. The authors found that current methods that should use dislikes still often show things you don’t like in top recommendations because their scoring doesn’t properly handle negative feedback. This problem is hidden because usual tests don’t penalize recommending disliked items. The authors propose new ways to measure how well systems avoid disliked items, helping improve recommendation quality.
Open → 2609.33346v1

SPADE metric measures truly surprising recommendations beyond popularity and similarity

SPADE: Escaping the Popularity-Similarity Frontier to Measure Serendipitous Recommendations

Abstract: Recommender systems engineer serendipity to foster active exploration and break predictable consumption cycles. The problem with existing offline beyond-accuracy metrics is that they often either isolate historical similarity or global popularity. We aim to design an evaluation metric that examines similarity, popularity, and actual user relevance. To achieve this, we introduce SPADE (Serendipitous Pareto Distance Evaluation). SPADE maps all items into a two-dimensional space to directly calculate a user-specific Pareto frontier of maximally popular and historically similar items. The final serendipity score is then computed by averaging the minimum Euclidean distance from this boundary strictly for the correctly recommended test-set items. Evaluating SPADE across five datasets and five baseline algorithms confirms its effectiveness; our results show that the metric successfully prevents algorithms from exploiting beyond-accuracy measures with irrelevant or non-personalized recommendations, reliably isolating serendipitous discoveries.

Fri 25 SeptInformation RetrievalArtificial IntelligenceMachine Learning
The gist
Recommender systems often suggest items based on popularity or similarity, which can make recommendations predictable. The authors created SPADE, a new way to evaluate how surprising or serendipitous recommendations are by considering popularity, similarity, and what the user actually likes. SPADE works by mapping items on a chart and measuring how far recommended items are from popular or similar items that a user already knows. Testing this across several datasets showed SPADE reliably identifies recommendations that are both relevant and genuinely unexpected.
Open → 2609.31164v1

Multimodal simulation improves website user experience recommendations

Automatic multimodal UX improvement recommendations from LLM agent user simulations

Abstract: Evaluating user experience (UX) on live websites through user testing is expensive, subjective, and difficult to scale. LLM agents offer a promising route to automating UX testing by simulating realistic user behaviour. However, existing simulation approaches typically lack multimodality and require time-consuming manual review to extract actionable insights. We formalise UX improvement recommendation from simulation data as a structured natural language generation and ranking problem, and establish an evaluation protocol using expert annotation and LLM-as-a-Judge. We present AMUSER, a multimodal framework which simulates user behaviour and automatically generates prioritised UX improvement recommendations from resulting data. We evaluate AMUSER on commercial websites and show that its recommendations substantially outperform those from text-only simulation (NDCG@3 = 0.758 versus 0.359) at an 89% lower simulation cost. Our results suggest an asymmetric role of multimodality: visual access during simulation improves recommendations through richer traces, while providing visual inputs during recommendation generation can modestly degrade quality. We also discuss practical deployment lessons from applying AMUSER to commercial websites.

Sat 19 SeptComputation and LanguageArtificial IntelligenceHuman-Computer Interaction
The gist
Testing how easy and pleasant websites are to use is usually expensive and slow because it needs real people. The authors created a system called AMUSER that uses AI to simulate users interacting with websites, including both what they see and do. This lets the system suggest ways to improve websites automatically and faster, with better suggestions than previous approaches that looked only at text actions. Interestingly, giving the AI visual information during the testing part helps a lot, but giving visuals when making suggestions can slightly hurt quality.
Open → 2609.22971v1