Implicit Regularization with Polynomial Growth in Deep Tensor Factorization

Kais Hariz, Hachem Kadri, Stéphane Ayache, Maher Moakher, Thierry Artières
7/18/2022
cs.LGcs.AIcs.NE

No confident code implementation found for this paper.

Abstract

We study the implicit regularization effects of deep learning in tensor factorization. While implicit regularization in deep matrix and 'shallow' tensor factorization via linear and certain type of non-linear neural networks promotes low-rank solutions with at most quadratic growth, we show that its effect in deep tensor factorization grows polynomially with the depth of the network. This provides a remarkably faithful description of the observed experimental behaviour. Using numerical experiments, we demonstrate the benefits of this implicit regularization in yielding a more accurate estimation and better convergence properties.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{hariz2022implicit,
  title  = {Implicit Regularization with Polynomial Growth in Deep Tensor Factorization},
  author = {Kais Hariz and Hachem Kadri and Stéphane Ayache and Maher Moakher and Thierry Artières},
  year   = {2022},
  eprint = {2207.08942},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2207.08942v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2207.08942.svg)](https://codeofpaper.com/paper/2207.08942)

Discussion