AI Paper Atlas

Research map / Bandits and online learning / Online convex optimization and games

Online Matrix Completion with Side Information

Mark Herbster, Stephen Pasteris, Lisa Tse

NeurIPS 2020 · Bandits and online learning › Online convex optimization and games · approach: Online learning with feedback graphs · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Reduce side-information noise from β=0.50 to β=0.00Online MEG (transductive) · Synthetic (9,9)-biclustered matrix, n=400error rate: 0.3$\pm$ 0.01 -> 0.11$\pm$ 0.0Improved
Reduce side-information noise from β=0.50 to β=0.00Online MEG (transductive) · Synthetic (9,9)-biclustered matrix, n=20error rate: 0.39$\pm$ 0.04 -> 0.31$\pm$ 0.03Improved
Increase matrix dimension from n=20 to n=400Online MEG (transductive), side-information noise β=0.00 · Synthetic (9,9)-biclustered matrixerror rate: 0.31$\pm$ 0.03 -> 0.11$\pm$ 0.0Improved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy