1 resultado para Neural network based walking
em Massachusetts Institute of Technology
Filtro por publicador
- Aberdeen University (2)
- Abertay Research Collections - Abertay University’s repository (1)
- 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 (3)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (3)
- Aquatic Commons (2)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (3)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (4)
- Aston University Research Archive (39)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (10)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (6)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (19)
- Boston University Digital Common (33)
- Brock University, Canada (2)
- Bulgarian Digital Mathematics Library at IMI-BAS (16)
- CaltechTHESIS (1)
- Cambridge University Engineering Department Publications Database (32)
- CentAUR: Central Archive University of Reading - UK (65)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (50)
- Cochin University of Science & Technology (CUSAT), India (10)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons @ Winthrop University (1)
- Digital Commons at Florida International University (11)
- Digital Peer Publishing (1)
- DigitalCommons@The Texas Medical Center (2)
- DRUM (Digital Repository at the University of Maryland) (2)
- Duke University (3)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (2)
- Greenwich Academic Literature Archive - UK (2)
- Helda - Digital Repository of University of Helsinki (5)
- Indian Institute of Science - Bangalore - Índia (49)
- Instituto de Engenharia Nuclear, Brazil - Carpe dIEN (2)
- Instituto Politécnico de Bragança (1)
- Instituto Politécnico do Porto, Portugal (12)
- Massachusetts Institute of Technology (1)
- National Center for Biotechnology Information - NCBI (2)
- Nottingham eTheses (3)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (5)
- Publishing Network for Geoscientific & Environmental Data (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (101)
- Queensland University of Technology - ePrints Archive (60)
- RDBU - Repositório Digital da Biblioteca da Unisinos (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (2)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (93)
- Research Open Access Repository of the University of East London. (5)
- SAPIENTIA - Universidade do Algarve - Portugal (12)
- School of Medicine, Washington University, United States (1)
- SerWisS - Server für Wissenschaftliche Schriften der Fachhochschule Hannover (1)
- Universidad Autónoma de Nuevo León, Mexico (1)
- Universidad de Alicante (3)
- Universidad del Rosario, Colombia (1)
- Universidad Politécnica de Madrid (14)
- Universidade Complutense de Madrid (1)
- Universidade Federal do Pará (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (5)
- Universitat de Girona, Spain (3)
- Université de Lausanne, Switzerland (1)
- University of Michigan (2)
- University of Queensland eSpace - Australia (24)
- WestminsterResearch - UK (2)
Resumo:
We consider the question "How should one act when the only goal is to learn as much as possible?" Building on the theoretical results of Fedorov [1972] and MacKay [1992], we apply techniques from Optimal Experiment Design (OED) to guide the query/action selection of a neural network learner. We demonstrate that these techniques allow the learner to minimize its generalization error by exploring its domain efficiently and completely. We conclude that, while not a panacea, OED-based query/action has much to offer, especially in domains where its high computational costs can be tolerated.