Passer à la navigation principale Passer à la recherche Passer au contenu principal

Low-rank interaction with sparse additive effects model for large data frames

  • Ecole polytechnique
  • Department of SE and EM
  • The Chinese University of Hong Kong
  • ESSEC Business School

Résultats de recherche: Contribution à un journal › Article de conférence › Revue par des pairs

4 Citations (Scopus)

Résumé

Many applications of machine learning involve the analysis of large data frames - matrices collecting heterogeneous measurements (binary, numerical, counts, etc.) across samples - with missing values. Low-rank models, as studied by Udell et al. [27], are popular in this framework for tasks such as visualization, clustering and missing value imputation. Yet, available methods with statistical guarantees and efficient optimization do not allow explicit modeling of main additive effects such as row and column, or covariate effects. In this paper, we introduce a low-rank interaction and sparse additive effects (LORIS) model which combines matrix regression on a dictionary and low-rank design, to estimate main effects and interactions simultaneously. We provide statistical guarantees in the form of upper bounds on the estimation error of both components. Then, we introduce a mixed coordinate gradient descent (MCGD) method which provably converges sub-linearly to an optimal solution and is computationally efficient for large scale data sets. We show on simulated and survey data that the method has a clear advantage over current practices.

langue originaleAnglais
Pages (de - à)5496-5506
Nombre de pages11
journalAdvances in Neural Information Processing Systems
Volume2018-December
étatPublié - 1 janv. 2018
Evénement32nd Conference on Neural Information Processing Systems, NeurIPS 2018 - Montreal, Canada
Durée: 2 déc. 2018 → 8 déc. 2018

Empreinte digitale

Examiner les sujets de recherche de « Low-rank interaction with sparse additive effects model for large data frames ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation