Back to Results
First PageMeta Content
Estimation theory / Maximum likelihood / Statistical theory / XTR / 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
Add to Reading List

Document Date: 2010-06-13 09:06:35


Open Document

File Size: 186,54 KB

Share Result on Facebook

City

Courville / Haifa / Cambridge / Mountain View / /

Company

MIT Press / Google / Vadhan S. P. / /

Country

Israel / United States / /

Currency

IDR / /

/

Facility

Amphitheatre Parkway / Building RBM Models / Columbia University / /

IndustryTerm

rough binary search / binary search technique / belief network / learning systems / binary search / polynomial-time randomized algorithm / polynomial-time algorithm / deep belief network / polynomialtime algorithm / dynamical systems / learning algorithm / energy / /

Organization

USA Rocco A. Servedio Computer Science Department / MIT / Columbia University / New York / /

Person

Philip M. Long Google / Ai / Az / Mansour / /

Position

length rt / author / rt / /

Product

Pentax K-x Digital Camera / /

ProvinceOrState

New York / California / /

PublishedMedium

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

Technology

corresponding polynomial-time algorithm / randomized algorithm / artificial intelligence / time algorithm / polynomial-time algorithm / Restricted Boltzmann Machines The algorithm / Machine Learning / polynomialtime algorithm / simulation / polynomial-time randomized algorithm / /

SocialTag