SARDINE: Simulator for Automated Recommendation in Dynamic and Interactive Environments

R Deffayet, T Thonet, D Hwang, V Lehoux… - ACM Transactions on …, 2024 - dl.acm.org
Simulators can provide valuable insights for researchers and practitioners who wish to
improve recommender systems, because they allow one to easily tweak the experimental …

Optimal algorithms for latent bandits with cluster structure

S Pal, AS Suggala, K Shanmugam… - … Conference on Artificial …, 2023 - proceedings.mlr.press
We consider the problem of latent bandits with cluster structure where there are multiple
users, each with an associated multi-armed bandit problem. These users are grouped into …

Revisiting weighted strategy for non-stationary parametric bandits

J Wang, P Zhao, ZH Zhou - International Conference on …, 2023 - proceedings.mlr.press
Non-stationary parametric bandits have attracted much attention recently. There are three
principled ways to deal with non-stationarity, including sliding-window, weighted, and restart …

Online low rank matrix completion

P Jain, S Pal - arxiv preprint arxiv:2209.03997, 2022 - arxiv.org
We study the problem of {\em online} low-rank matrix completion with $\mathsf {M} $ users,
$\mathsf {N} $ items and $\mathsf {T} $ rounds. In each round, the algorithm recommends …

Online matrix completion: A collaborative approach with hott items

D Baby, S Pal - arxiv preprint arxiv:2408.05843, 2024 - arxiv.org
We investigate the low rank matrix completion problem in an online setting with ${M} $
users, ${N} $ items, ${T} $ rounds, and an unknown rank-$ r $ reward matrix ${R}\in\mathbb …

Blocked collaborative bandits: online collaborative filtering with per-item budget constraints

S Pal, A Suggala, K Shanmugam… - Advances in Neural …, 2024 - proceedings.neurips.cc
We consider the problem of\emph {blocked} collaborative bandits where there are multiple
users, each with an associated multi-armed bandit problem. These users are grouped …

Online Low Rank Matrix Completion

S Pal, P Jain - The Eleventh International Conference on Learning …, 2022 - openreview.net
We study the problem of online low-rank matrix completion with $\mathsf {M} $ users,
$\mathsf {N} $ items and $\mathsf {T} $ rounds. In each round, the algorithm recommends …

Multi-user reinforcement learning with low rank rewards

DM Nagaraj, SS Kowshik, N Agarwal… - International …, 2023 - proceedings.mlr.press
We consider collaborative multi-user reinforcement learning, where multiple users have the
same state-action space and transition probabilities but different rewards. Under the …

Non-stationary Transformer Architecture: A Versatile Framework for Recommendation Systems

Y Liu, G Li, TR Payne, Y Yue, KL Man - Electronics, 2024 - mdpi.com
Recommendation systems are crucial in navigating the vast digital market. However, user
data's dynamic and non-stationary nature often hinders their efficacy. Traditional models …

Creating dynamic checklists via Bayesian case-based reasoning: Towards decent working conditions for all

EL Flogard, OJ Mengshoel, K Bach - 2022 - ntnuopen.ntnu.no
Every year there are 1.9 million deaths world-wide attributed to occupational health and
safety risk factors. To address poor working conditions and fulfill UN's SDG 8," protect labour …