WarpRec: Unifying Academic Rigor and Industrial Scale for Responsible, Reproducible, and Efficient Recommendation
Authors: Marco Avolio, Potito Aghilar, Sabino Roccotelli, Vito Walter Anelli, Chiara Mallamaci, Vincenzo Paparella, Marco Valentini, Alejandro Bellogín, Michelantonio Trizio, Joseph Trotta, Antonio Ferrara, Tommaso Di Noia
Innovation in Recommender Systems is currently impeded by a fractured ecosystem, where researchers must choose between the ease of in-memory experimentation and the costly, complex rewriting required for distributed industrial engines. To bridge this gap, we present WarpRec, a high-performance framework that eliminates this trade-off through a novel, backend-agnostic architecture. It includes 50+ state-of-the-art algorithms, 40 metrics, and 19 filtering and splitting strategies that seamlessly transition from local execution to distributed training and optimization. The framework enforces ecological responsibility by integrating CodeCarbon for real-time energy tracking, showing that scalability need not come at the cost of scientific integrity or sustainability. Furthermore, WarpRec anticipates the shift toward Agentic AI, leading Recommender Systems to evolve from static ranking engines into interactive tools within the Generative AI ecosystem. In summary, WarpRec not only bridges the gap between academia and industry but also can serve as the architectural backbone for the next generation of sustainable, agent-ready Recommender Systems. Code is available at https://github.com/sisinflab/warprec/
Figures & tables
Figure 1. The modular architecture of WarpRec . Five decoupled modules manage the end-to-end recommendation lifecycle, from data ingestion and processing to model training and evaluation. An Application Layer exposes the recommender through a REST API and MCP agentic interface.
Data
Optim. & Train.
Ext. & Int.
Rigor & Repro.
Green AI
Metrics
Stats
Backend
Mgmt
Env
Tuning
Ext.
Int.
Tests
Corr.
Repro.
Report.
Bey. Acc.
Comp.
Catalog
Eager (Pandas)
Fast (Polars)
Distrib. (Spark)
Cloud I/O
Multi-GPU (DDP)
Cluster (Ray)
Search Alg.
Pruning (ASHA)
Callbacks
Agentic AI
REST API
Paired (T/Wilc)
Indep (Kru/Whi)
FWER (Bonf)
FDR (Ben-Hoch)
Seed
Checkpoint
Carbon Track
Energy Report
Bias
Fairness
Nov/Div
Multi-Objective
GPU Accel.
# Models
# Split/Filtering
# Metrics
Classic
LibRec (2022) ( Guo et al., 2015 )
✓
✓
0
0
0
0
55
10
11
MyMediaLite (2020) ( Gantner et al., 2011 )
✓
✓
0
0
0
0
18
6
8
Surprise (2024) ( Hug, 2020 )
✓
✓
✓
0
0
0
0
7
6
4
Table 1. Comprehensive comparison of WarpRec against frameworks identified in the literature (with year of the last update) across six dimensions: Data, Optimization & Training, Extensions & Integration, Rigor & Reproducibility, Green AI, Metrics, and Statistics.
Dataset
# Users
# Items
# Interactions
Sparsity
MovieLens-1M
6,040
3,883
1,000,209
95.7353%
MovieLens-32M
200,948
87,585
32,000,204
99.8182%
NetflixPrize-100M
480,189
17,770
100,480,507
98.8281%
Table 2. Statistical summary of the experimental datasets.
Data
Mode
EASE R
ItemKNN
LightGCN
NeuMF
SASRec
MovieLens-1M
S
16/1/64
–
16/1/64
16/1/64
16/1/64
P
–
–
32/1/64
32/1/64
32/2/64
MovieLens-32M
S
16/1/256
–
16/1/128
16/1/128
16/1/128
P
–
–
32/4/128
32/4/128
32/4/128
NetflixPrize-100M
S
16/1/192
16/1/192
16/1/192
16/1/192
16/1/192
P
–
–
32/4/192
32/4/192
32/4/192
Table 3. Computational resource requirements (CPUs / GPUs / RAM in GB) by dataset and execution mode. P : Parallel; S : Serial.
NetflixPrize-100M (Medium Scale)
Fram.
C
Prep.
Train
Eval
HPO
Total
nDCG
EASE R
Cornac
1
7m 58s
2m 35s
29m 45s
3h 14m
3h 22m
0.3143
Elliot
1
2m 39s
2m 54s
5h 17m
Time Limit Exceeded (4/6)
RecBole
1
11m 17s
26m 29s
20m 21s
4h 41m
5h 49m
0.3283
DaisyRec
1
1m 35s
1h 17m
Out of Memory - RAM
WarpRec †
1
30.25s
3m 9s
21m 13s
2h 26m
2h 26m
0.3035
Table 4. End-to-end performance and scalability benchmark. WarpRec is compared against leading frameworks on datasets of increasing scale; † denotes its serial execution without parallelization. Best results are reported in bold, second best are underlined .
Metric
ItemKNN
EASE R
NeuMF
LightGCN
SASRec
Emissions
0.0002
0.0005
0.0004
0.0095
0.0012
Emissions Rate
2.96 e−7
3.09 e−7
4.97 e−7
4.00 e−7
5.33 e−7
CPU Power
137.8144
155.3458
219.4410
154.1137
152.7022
GPU Power
75.9096
71.7731
177.2569
157.3857
278.5554
CPU Energy
0.0248
0.0638
0.0530
1.0235
0.0967
GPU Energy
0.0133
0.0292
0.0424
1.0373
0.1847
Table 5. Green AI Profiling of WarpRec on NetflixPrize-100M, captured via CodeCarbon. Best results are reported in bold.
Figure 2. Sequential Recommendation via WarpRec MCP Interface. The AI Agent leverages a SASRec model trained on MovieLens-32M.
Auto-research agents have shown the potential to automate hypothesis generation, experiment execution, and iterative refinement. However, scaling this paradigm to industry-scale recommendation models introduces two challenges: (1) long feedback loops, where model training can take days, making serial iteration prohibitively slow and requiring parallel exploration across multiple research directions; and (2) system complexity, where large configurations, fragile infrastructure dependencies, and multi-day GPU jobs require robust and recoverable execution. We present Auto-RecSys, an autonomous research system for long-horizon experimentation on industry-scale recommendation models. Auto-RecSys addresses these challenges through three harness designs: (1) distributed asynchronous execution for running multiple experiments in parallel across servers, (2) centralized cross-server memory for persistent and recoverable execution across sessions and failures, and (3) cognitive-procedural separation, where natural-language skill files guide LLM reasoning while deterministic scripts enforce operational correctness. Auto-RecSys further employs a dual-loop self-evolving architecture: an Execution Evolution Loop in which model-specific playbooks accumulate operational knowledge by recording failed attempts and crystallizing successful pipelines, and an Idea Evolution Loop in which experimental outcomes inform subsequent ideation. Evaluated on recommendation models, Auto-RecSys significantly reduces the human time required per experiment cycle and improves execution reliability as its playbooks mature.
Recommendation algorithm iteration is moving from an artisanal, engineer-bound process toward an industrialized research loop, but this transition remains blocked by a structural execution bottleneck: the idea-to-launch cycle still depends on human engineers to generate hypotheses, modify production code, launch A/B experiments, and attribute online results. Innovation therefore scales linearly with headcount rather than compounding with evidence, compute, and accumulated experimental knowledge. We present AgentX, a production-deployed multi-agent system that fundamentally restructures this production function. AgentX operates as a self-evolving development engine: it autonomously generates, implements, evaluates, and learns from recommendation experiments at a scale and pace that no manual workflow can sustain. The system orchestrates four tightly coupled stages in a closed loop. A Brainstorm Agent synthesizes evidence from historical experiments, system architecture, data analysis, and external research into ranked, executable proposals. A Developing Agent translates each proposal into production-ready code through repository-grounded generation and multi-dimensional reliability verification. An Evaluation Agent conducts safe online rollout with guardrail-vetoed A/B judgment, converting both successes and failures into structured knowledge assets. A Harness Evolution layer (SGPO) then distills execution trajectories into semantic-gradient updates that continuously sharpen the agents themselves -- making the system not merely automated, but self-improving.
Optimizing modern recommender models still depends heavily on engineers manually iterating over architectural, objective, and training-strategy changes. While LLM-based agents can automate this trial-and-error process, allowing the LLM to both select modification directions and generate concrete hypotheses often leads to unstable search under limited experiment budgets. Inspired by the above challenge, we propose RecHarness, a Bandit-Routed Agentic Harness for automated recommender model optimization. RecHarness separates the optimization process into two steps: a bandit router selects the next modification direction according to historical validation feedback, while the LLM generates a concrete optimization hypothesis and executable code edit within the selected direction. To sustain long-horizon exploration, RecHarness uses a jump-basin mechanism to activate a structural-jump arm when local edits stagnate. Across multiple recommendation tasks, datasets, and model backbones, RecHarness achieves more stable performance improvements and uses limited trial budgets more effectively than LLM-reasoning search. During a 7-day online A/B test on a large-scale short-video advertising platform, the selected candidate improves ADVV by 2.084%, Revenue by 0.534%, and Exposure by 0.559%. Code is available at https://github.com/6lyc/RecHarness.
Haoran Ling, Yuecheng Li, Zeyu Song +5
Georgia Institute of Technology · Kuaishou Technology, China