Adversarial online collaborative filtering

MaRDI QIDQ7017077zbMATH OpenFDO

Authors Stephen Pasteris, Fabio Vitale, Mark Herbster, Claudio Gentile, Andre Panisson

Publication date 6 March 2025

Full work available at URL https://proceedings.mlr.press/v237/pasteris24a.html

zbMATH Keywords

biclusteringcollaborative filteringno-repetition constraintonline learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Cites work

• A Channel Coding Perspective of Collaborative Filtering
• Bandit algorithms
• Estimation of high-dimensional low-rank matrices
• Low-rank matrix completion using alternating minimization
• Matrix Completion From a Few Entries
• Ranked bandits in metric spaces: learning diverse rankings over large document collections
• Regret analysis of stochastic and nonstochastic multi-armed bandit problems
• Regret Bounds and Regimes of Optimality for User-User and Item-Item Collaborative Filtering
• Restricted strong convexity and weighted matrix completion: optimal bounds with noise
• Solving Bernoulli rank-one bandits with unimodal Thompson sampling
• Statistical analysis of k-nearest neighbor collaborative recommendation

This page was built for publication: Adversarial online collaborative filtering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7017077)