Discovering Structure by Learning Sparse Graphs Brenden M. Lake and Joshua B. Tenenbaum Department of Brain and Cognitive Sciences Massachusetts Institute of Technology {brenden, jbt Abstract - M-104 - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2011-02-04 14:34:11 Machine learning Artificial intelligence Learning Mathematics Sparse approximation Semantic memory Regularization Supervised learning Semantic network Sparse matrix Dense graph		Discovering Structure by Learning Sparse Graphs Brenden M. Lake and Joshua B. Tenenbaum Department of Brain and Cognitive Sciences Massachusetts Institute of Technology {brenden, jbt}@mit.edu Abstract Add to Reading List Source URL: cims.nyu.edu Download Document from Source Website File Size: 653,10 KB Share Document on Facebook

	Low Power Sparse Approximation on Reconfigurable Analog Hardware Samuel Shapero Student Member, IEEE*, Adam Charles Student Member, IEEE, Christopher Rozell Senior Member, IEEE, and Paul Hasler Senior Member, IEEE Abstr DocID: 1vqlE - View Document
	Sparse BRDF Approximation using Compressive Sensing Benoît Zupancic, Cyril Soler To cite this version: Benoît Zupancic, Cyril Soler. Sparse BRDF Approximation using Compressive Sensing. 6th Siggraph Conference and Exhi DocID: 1tNDO - View Document
	Approximation Bounds for Sparse Principal Component Analysis Alexandre d’Aspremont, CNRS & Ecole Polytechnique. With Francis Bach, INRIA-ENS and Laurent El Ghaoui, U.C. Berkeley. DocID: 1tHn2 - View Document
	Approximation Bounds for Sparse PCA Alexandre d’Aspremont, CNRS & Ecole Polytechnique with Francis Bach, INRIA-ENS and Laurent El Ghaoui, U.C. Berkeley A. d’Aspremont DocID: 1tEcB - View Document
	Linear Algebraic Structure of Word Senses, with Applications to Polysemy arXiv:1601.03764v1 [cs.CL] 14 JanSanjeev Arora DocID: 1rogM - View Document