ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1711.02198
  4. Cited By
Regret Bounds and Regimes of Optimality for User-User and Item-Item
  Collaborative Filtering

Regret Bounds and Regimes of Optimality for User-User and Item-Item Collaborative Filtering

6 November 2017
Guy Bresler
Mina Karzand
ArXivPDFHTML

Papers citing "Regret Bounds and Regimes of Optimality for User-User and Item-Item Collaborative Filtering"

4 / 4 papers shown
Title
Explaining the Success of Nearest Neighbor Methods in Prediction
George H. Chen
Devavrat Shah
OOD
69
145
0
21 Feb 2025
Adversarial Online Collaborative Filtering
Adversarial Online Collaborative Filtering
Stephen Pasteris
Fabio Vitale
Mark Herbster
Claudio Gentile
Andre' Panisson
22
0
0
11 Feb 2023
Optimal Algorithms for Latent Bandits with Cluster Structure
Optimal Algorithms for Latent Bandits with Cluster Structure
S. Pal
A. Suggala
Karthikeyan Shanmugam
Prateek Jain
37
9
0
17 Jan 2023
Online Low Rank Matrix Completion
Online Low Rank Matrix Completion
Prateek Jain
S. Pal
42
9
0
08 Sep 2022
1