Skip to main navigation Skip to search Skip to main content

Learning coordinate covariances via gradients

Sayan Mukherjee, Ding-Xuan Zhou

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

Abstract

We introduce an algorithm that learns gradients from samples in the supervised learning framework. An error analysis is given for the convergence of the gradient estimated by the algorithm to the true gradient. The utility of the algorithm for the problem of variable selection as well as determining variable covariance is illustrated on simulated data as well as two gene expression data sets. For square loss we provide a very efficient implementation with respect to both memory and time.
Original languageEnglish
Pages (from-to)519-549
JournalJournal of Machine Learning Research
Volume7
Publication statusPublished - Mar 2006

Research Keywords

  • Generalization bounds
  • Reproducing kernel Hilbert space
  • Tikhnonov regularization
  • Variable selection

Fingerprint

Dive into the research topics of 'Learning coordinate covariances via gradients'. Together they form a unique fingerprint.

Cite this