AI Paper Atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

Mistake Bounds for Binary Matrix Completion

Mark Herbster, Stephen Pasteris, Massimiliano Pontil

NeurIPS 2016 · Learning theory and algorithms › Matrix and tensor methods · approach: Matrix completion and factorization · 7 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
Use Matrix Exponentiated Gradient (Matrix Winnow-style) online prediction instead of per-task Kernel Perceptron with a fixed kernelbinary matrix completion in online setting · theoretical mistake bound (Theorem 3.1)mistake bound scalingNo clear effect
Compare bound to trace-norm regret bounds: margin-complexity-based bound needs ~n examples vs ~n^{3/2} in [16] and ~n^{7/4} in [17] to become non-trivialonline matrix completion bound · theoretical comparison with [16], [17]number of observed entries before bound is non-trivialImproved

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