Probabilistic Low-Rank Matrix Completion with Adaptive Spectral Regularization Algorithms | Zendy

Adrien Todeschini | Zendy; François Caron | Zendy; Marie Chavent | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Probabilistic Low-Rank Matrix Completion with Adaptive Spectral Regularization Algorithms

Author(s) -

Adrien Todeschini,

François Caron,

Marie Chavent

Publication year - 2013

Publication title -

hal (le centre pour la communication scientifique directe)

Language(s) - Uncategorized

Resource type - Conference proceedings

Subject(s) - low rank approximation , algorithm , rank (graph theory) , matrix (chemical analysis) , matrix completion , eight point algorithm , probabilistic logic , regularization (linguistics) , iterative method , computer science , expectation–maximization algorithm , mathematics , representation (politics) , mathematical optimization , symmetric matrix , artificial intelligence , state transition matrix , eigenvalues and eigenvectors , gaussian , maximum likelihood , statistics , mathematical analysis , quantum mechanics , physics , combinatorics , hankel matrix , materials science , law , composite material , political science , politics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research