Back to Results
First PageMeta Content
XTR / Maximum likelihood / Time complexity / Spectral theory of ordinary differential equations / Non-analytic smooth function / Theoretical computer science / Mathematics / Applied mathematics


Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate Philip M. Long Google
Add to Reading List

Document Date: 2013-08-07 12:09:14


Open Document

File Size: 218,64 KB

Share Result on Facebook

City

Haifa / Cambridge / /

Company

MIT Press / Google / /

Country

Israel / /

Currency

IDR / /

/

Facility

University Abstract Restricted Boltzmann Machines / Building RBM Models / /

IndustryTerm

rough binary search / Information processing / binary search technique / belief network / learning systems / binary search / polynomial-time randomized algorithm / Approximate learning algorithm / polynomial-time algorithm / deep belief network / e -approximation / polynomialtime algorithm / dynamical systems / learning algorithm / energy / /

Organization

Columbia University / MIT / /

Person

Parallel Distributed / Rocco A. Servedio / Ai / Philip M. Long / /

Position

length rt / author / rt / /

Product

Pentax K-x Digital Camera / /

PublishedMedium

Machine Learning / Journal of Machine Learning Research / Theory of Computing / /

Technology

Approximate learning algorithm / corresponding polynomial-time algorithm / randomized algorithm / artificial intelligence / time algorithm / polynomial-time algorithm / Machine Learning / polynomialtime algorithm / simulation / polynomial-time randomized algorithm / /

SocialTag