atlas

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

Learning-Based Low-Rank Approximations

NeurIPS 2019 · Learning theory and algorithms › Matrix and tensor methods · approach: Matrix completion and factorization · 18 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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
Train the sparse sketch matrix on examples from the same datasetSCW low-rank approximation · Logo, Eagle, Friends, Hyper, and Tech (k=10, m=20)test error: 2.09 -> 0.10; 4.31 -> 0.18; 4.11 -> 0.22; 2.92 -> 0.52; 7.99 -> 2.95Helped
Use a mixed training set from Logo, Eagle, and Friends instead of training only on LogoLearned sketch for Logo test matrices · Logotest error: 0.27 -> 0.67Hurt
Replace a random sketch with a half-trained, half-random sketchSCW low-rank approximation · Logo, Hyper, and Tech (k=10, m=20)test error: 2.09 -> 0.20; 2.92 -> 0.78; 7.99 -> 3.73Helped
Train one half of the sketch separately, then append a random halfSCW low-rank approximation · Logo, Hyper, and Tech (k=10, m=20)test error: 2.09 -> 0.24; 2.92 -> 0.87; 7.99 -> 3.69Helped

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