atlas

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

Implicit Regularization with Polynomial Growth in Deep Tensor Factorization

ICML 2022 · Learning theory and algorithms › Matrix and tensor methods · approach: Low-rank tensor completion · 0 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
increase depth of deep CP factorization from 0 to 5deep CP tensor factorization · Synthetic 10^4 tensor, 20% observedeffective CP-rank of learned tensorHelped
increase depth (ablation)deep CP factorization · Synthetic, 75-90% missingbest validation lossMixed
use small-variance initialization vs large initializationdeep CP factorization · Syntheticconvergence to low-rank solutionMixed
increase depthdeep CP factorization · Synthetic, generalization loss across initializationsrobustness to initializationHelped

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