Inégalités d'oracle exactes pour la prédiction d'une matrice en grande dimension
Résumé
We consider the problem of prediction of a high dimensional matrix of size $m \times T$ with noise, meaning that $m T$ is much larger than the sample size $n$. We focus on the trace norm minimization algorithm, but also on other penalizations. It is now well-known that such algorithms can be used for matrix completion, as well as other problems, such as multi-task learning, see \cite{candes-plan2,candes-recht08,candes-plan1,candes-tao1, rohde-tsyb09, MR2417263}. In this work, we propose sharp oracle inequalities in a statistical learning setup.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...