atlas

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

Implicit Regularization in Tensor Factorization

ICML 2021 · Learning theory and algorithms › Matrix and tensor methods · approach: Low-rank tensor completion · 1 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
Fit with low tensor rank instead of randomizing images or labelsTensor-factorized predictors · MNIST and Fashion-MNISTmean squared errorHelped
Use smaller initializationTensor factorization on synthetic low-rank tensor completion · Rank-5 tensor completionnumber of components substantially departing from zeroHelped
Replace fixed small learning rate with adaptive learning rateTensor factorization on synthetic tensor completion · Synthetic low-rank tensor completionlearning dynamicsNo clear effect
Use tensor factorization instead of a linear predictorPredictors for MNIST and Fashion-MNIST · MNIST and Fashion-MNISTmean squared errorHelped

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