Limitations and Future Trends in Neural Computation (NATO Science Series: Computer & Systems Sciences). Este artículo no está disponible.
Idioma: inglés
Editorial: Ios Pr Inc, 2003
- Tapa dura
- Usado

Vendedor patrimonial
Librería: bmyguest books, Toronto, ON, Canadabmyguest books
Vendedor de 4 estrellas
Vendedor de IberLibro desde 4 de mayo de 1999
No disponible
Tapa dura
Condición: Usado - Bueno
EUR 42,23
Descripción del artículo del vendedor
243 Pages With The Index. In Fine Condition. Hardcover. Name Inscription At The Front Endpaper.We will state signed at the description section. we confirm they are signed via email or stated in the description box. - Specializing in academic, collectiblle and historically significant, providing the utmost quality and customer service satisfaction. For any questions feel free to email us.
N° de ref. del artículo 038048
- Título
- Limitations and Future Trends in Neural Computation (NATO Science Series: Computer & Systems Sciences)
- Autor
- Ablameyko, Sergey; NATO ADVANCED RESEARCH WORKSHOP ON LIMIT
- Editorial
- Ios Pr Inc
- Año de publicación
- 2003
- Estado
- Very Good
- Encuadernación
- Hardcover
- Idioma
- inglés
- ISBN 10
- 1586033247
- ISBN 13
- 9781586033248
- Peso del artículo
- 2 onzas
- Dimensiones
- 9x6x0
- Catálogos de vendedores
- HOBBIES & ANTIQUES, Art
This work reports critical analyses on complexity issues in the continuum setting and on generalization to new examples, which are two basic milestones in learning from examples in connectionist models. The problem of loading the weights of neural networks, which is often framed as continuous optimization, has been the target of many criticisms, since the potential solution of any learning problem is limited by the presence of local minimal in the error function. The notion of efficient solution needs to be formalized so as to provide useful comparisons with the traditional theory of computational complexity in the discrete setting. It also covers up-to-date developments in computational mathematics.
“Sinopsis” puede pertenecer a otra edición de este título.
De la contraportada
This book reports critical analyses on complexity issues in the continuum setting and on generalization to new examples, which are two basic milestones in learning from examples in connectionist models. The problem of loading the weights of neural networks, which is often framed as continuous optimization, has been the target of many criticisms, since the potential solution of any learning problem is severely limited by the presence of local minimal in the error function. The maturity of the field requires to convert the quest for a general solution to all learning problems into the understanding of which learning problems are likely to be solved efficiently. Likewise, the notion of efficient solution needs to be formalized so as to provide useful comparisons with the traditional theory of computational complexity in the discrete setting. The book covers these topics focussing also on recent developments in computational mathematics, where interesting notions of computational complexity emerge in the continuum setting.
“Acerca de” puede pertenecer a otra edición de este título.