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 - Center for Entrepreneurship and Innovation - 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

	2018 IEEE International Symposium on High Performance Computer Architecture OuterSPACE: An Outer Product based Sparse Matrix Multiplication Accelerator Subhankar Pal∗ Jonathan Beaumont∗ Dong-Hyeon Park∗ Aporva Ama DocID: 1uUeI - View Document
	0 Autotuning Runtime Specialization for Sparse Matrix-Vector Multiplication BUSE YILMAZ, Ozyegin University BARIS ¸ AKTEMUR, Ozyegin University DocID: 1uMPm - View Document
	Recommended Reading Efficient Parallel Sparse Matrix–Vector Multiplication Using Graph and Hypergraph Partitioning U.V. C DocID: 1uzWI - View Document
	EFFICIENT SPARSE MATRIX PROCESSING FOR NILM NILM Workshop 2014 Stephen Makonin, PhD Candidate, ISP, smIEEE! June 3,1 2014 DocID: 1uf4G - View Document
	Published as a conference paper at ICLRUnderstanding Trainable Sparse Coding via matrix factorization arXiv:1609.00285v4 [stat.ML] 29 May 2017 DocID: 1ued9 - View Document