A Thorough Performance Benchmarking on Lightweight Embedding-based Recommender Systems

HV Tran, T Chen, N Quoc Viet Hung, Z Huang… - ACM Transactions on …, 2025 - dl.acm.org
Since the creation of the Web, recommender systems (RSs) have been an indispensable
personalization mechanism in information filtering. Most state-of-the-art RSs primarily …

Learning rate schedules in the presence of distribution shift

M Fahrbach, A Javanmard… - … on Machine Learning, 2023 - proceedings.mlr.press
We design learning rate schedules that minimize regret for SGD-based online learning in
the presence of a changing data distribution. We fully characterize the optimal learning rate …

Heterogeneous acceleration pipeline for recommendation system training

M Adnan, YE Maboud, D Mahajan… - 2024 ACM/IEEE 51st …, 2024 - ieeexplore.ieee.org
Recommendation models rely on deep learning networks and large embedding tables,
resulting in computationally and memory-intensive processes. These models are typically …

Priorboost: An adaptive algorithm for learning from aggregate responses

A Javanmard, M Fahrbach, V Mirrokni - arxiv preprint arxiv:2402.04987, 2024 - arxiv.org
This work studies algorithms for learning from aggregate responses. We focus on the
construction of aggregation sets (called bags in the literature) for event-level loss functions …

Clustering the sketch: dynamic compression for embedding tables

H Tsang, T Ahle - Advances in Neural Information …, 2023 - proceedings.neurips.cc
Embedding tables are used by machine learning systems to work with categorical features.
In modern Recommendation Systems, these tables can be very large, necessitating the …

Efficient Data Representation Learning in Google-scale Systems

DZ Cheng, R Wang, WC Kang, B Coleman… - Proceedings of the 17th …, 2023 - dl.acm.org
" Garbage in, Garbage out" is a familiar maxim to ML practitioners and researchers, because
the quality of a learned data representation is highly crucial to the quality of any ML model …

GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems

X Wu, D Loveland, R Chen, Y Liu, X Chen… - arxiv preprint arxiv …, 2024 - arxiv.org
Deep recommender systems rely heavily on large embedding tables to handle high-
cardinality categorical features such as user/item identifiers, and face significant memory …

Removing Neurons From Deep Neural Networks Trained With Tabular Data

A Klemetti, M Raatikainen, J Kivimäki… - IEEE Open Journal …, 2024 - ieeexplore.ieee.org
Deep neural networks bear substantial cloud computational loads and often surpass client
devices' capabilities. Research has concentrated on reducing the inference burden of …

BayesCNS: A Unified Bayesian Approach to Address Cold Start and Non-Stationarity in Search Systems at Scale

R Ardywibowo, R Sunki, L Kuo, S Nayak - arxiv preprint arxiv:2410.02126, 2024 - arxiv.org
Information Retrieval (IR) systems used in search and recommendation platforms frequently
employ Learning-to-Rank (LTR) models to rank items in response to user queries. These …