136 resultados para Turing machines.
Filtro por publicador
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (2)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (7)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (6)
- Applied Math and Science Education Repository - Washington - USA (1)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (1)
- Archive of European Integration (13)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (17)
- Aston University Research Archive (36)
- Biblioteca Digital da Câmara dos Deputados (2)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (3)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (1)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (17)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (13)
- Brock University, Canada (3)
- Bulgarian Digital Mathematics Library at IMI-BAS (1)
- CaltechTHESIS (4)
- Cámara de Comercio de Bogotá, Colombia (1)
- Cambridge University Engineering Department Publications Database (112)
- CentAUR: Central Archive University of Reading - UK (42)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (12)
- Collection Of Biostatistics Research Archive (1)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (1)
- Dalarna University College Electronic Archive (2)
- Department of Computer Science E-Repository - King's College London, Strand, London (8)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons at Florida International University (6)
- Digital Peer Publishing (1)
- DigitalCommons@The Texas Medical Center (1)
- DigitalCommons@University of Nebraska - Lincoln (1)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (3)
- Gallica, Bibliotheque Numerique - Bibliothèque nationale de France (French National Library) (BnF), France (16)
- Greenwich Academic Literature Archive - UK (7)
- Helda - Digital Repository of University of Helsinki (21)
- Indian Institute of Science - Bangalore - Índia (136)
- Instituto Politécnico do Porto, Portugal (2)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Massachusetts Institute of Technology (11)
- Memorial University Research Repository (1)
- Ministerio de Cultura, Spain (3)
- National Center for Biotechnology Information - NCBI (5)
- Nottingham eTheses (3)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (20)
- Queensland University of Technology - ePrints Archive (191)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório Digital da Universidade Municipal de São Caetano do Sul - USCS (1)
- Repositório Institucional da Universidade Estadual de São Paulo - UNESP (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (22)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (3)
- School of Medicine, Washington University, United States (1)
- Scielo Uruguai (1)
- Universidad del Rosario, Colombia (1)
- Universidad Politécnica de Madrid (16)
- Université de Montréal (1)
- Université de Montréal, Canada (9)
- Université Laval Mémoires et thèses électroniques (1)
- University of Canberra Research Repository - Australia (1)
- University of Michigan (107)
- University of Queensland eSpace - Australia (10)
- University of Southampton, United Kingdom (4)
- University of Washington (1)
- Worcester Research and Publications - Worcester Research and Publications - UK (1)
Resumo:
The Restricted Boltzmann Machines (RBM) can be used either as classifiers or as generative models. The quality of the generative RBM is measured through the average log-likelihood on test data. Due to the high computational complexity of evaluating the partition function, exact calculation of test log-likelihood is very difficult. In recent years some estimation methods are suggested for approximate computation of test log-likelihood. In this paper we present an empirical comparison of the main estimation methods, namely, the AIS algorithm for estimating the partition function, the CSL method for directly estimating the log-likelihood, and the RAISE algorithm that combines these two ideas.