Simple, compact toolkit for designing and analyzing algorithms, with concrete examples from control and communications engineering, artificial intelligence, economic modelling. The key is viewing algorithms as noisy discretizations of limiting differential equations, which are usually easier to handle. Novel topics include finite-time behaviour, multiple timescales and asynchronous implementation. Powerful stuff!
"Sinopsis" puede pertenecer a otra edición de este libro.
Vivek S. Borkar is dean of the School of Technology and Computer Science at the Tata Institute of Fundamental Research. A distinguished researcher in stochastic and adaptive control, he distils his deep knowledge and broad experience in this motivating book.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: Antártica, Madrid, M, España
Cartoné (tapa dura cartón). Condición: New. Estado de la sobrecubierta: Nuevo. 01. LIBRO. Nº de ref. del artículo: 888038
Cantidad disponible: 1 disponibles
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Condición: New. Nº de ref. del artículo: ABLIING23Feb2416190005081
Cantidad disponible: Más de 20 disponibles
Librería: California Books, Miami, FL, Estados Unidos de America
Condición: New. Nº de ref. del artículo: I-9780521515924
Cantidad disponible: Más de 20 disponibles
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
Hardcover. Condición: new. Hardcover. This simple, compact toolkit for designing and analyzing stochastic approximation algorithms requires only basic literacy in probability and differential equations. Yet these algorithms have powerful applications in control and communications engineering, artificial intelligence and economic modelling. The dynamical systems viewpoint treats an algorithm as a noisy discretization of a limiting differential equation and argues that, under reasonable hypotheses, it tracks the asymptotic behaviour of the differential equation with probability one. The differential equation, which can usually be obtained by inspection, is easier to analyze. Novel topics include finite-time behaviour, multiple timescales and asynchronous implementation. There is a useful taxonomy of applications, with concrete examples from engineering and economics. Notably it covers variants of stochastic gradient-based optimization schemes, fixed-point solvers, which are commonplace in learning algorithms for approximate dynamic programming, and some models of collective behaviour. Three appendices give background on differential equations and probability. Simple, compact toolkit for designing and analyzing algorithms, with concrete examples from control and communications engineering, artificial intelligence, economic modelling. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9780521515924
Cantidad disponible: 1 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Hardcover. Condición: Brand New. 1st edition. 164 pages. 9.25x6.00x0.50 inches. In Stock. This item is printed on demand. Nº de ref. del artículo: __0521515920
Cantidad disponible: 1 disponibles
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
Hardback. Condición: New. This simple, compact toolkit for designing and analyzing stochastic approximation algorithms requires only basic literacy in probability and differential equations. Yet these algorithms have powerful applications in control and communications engineering, artificial intelligence and economic modelling. The dynamical systems viewpoint treats an algorithm as a noisy discretization of a limiting differential equation and argues that, under reasonable hypotheses, it tracks the asymptotic behaviour of the differential equation with probability one. The differential equation, which can usually be obtained by inspection, is easier to analyze. Novel topics include finite-time behaviour, multiple timescales and asynchronous implementation. There is a useful taxonomy of applications, with concrete examples from engineering and economics. Notably it covers variants of stochastic gradient-based optimization schemes, fixed-point solvers, which are commonplace in learning algorithms for approximate dynamic programming, and some models of collective behaviour. Three appendices give background on differential equations and probability. Nº de ref. del artículo: LU-9780521515924
Cantidad disponible: Más de 20 disponibles
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
Hardback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 410. Nº de ref. del artículo: C9780521515924
Cantidad disponible: Más de 20 disponibles
Librería: Majestic Books, Hounslow, Reino Unido
Condición: New. Print on Demand pp. ix + 164. Nº de ref. del artículo: 7437063
Cantidad disponible: 4 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Hardcover. Condición: Brand New. 1st edition. 164 pages. 9.25x6.00x0.50 inches. In Stock. Nº de ref. del artículo: x-0521515920
Cantidad disponible: 2 disponibles
Librería: CitiRetail, Stevenage, Reino Unido
Hardcover. Condición: new. Hardcover. This simple, compact toolkit for designing and analyzing stochastic approximation algorithms requires only basic literacy in probability and differential equations. Yet these algorithms have powerful applications in control and communications engineering, artificial intelligence and economic modelling. The dynamical systems viewpoint treats an algorithm as a noisy discretization of a limiting differential equation and argues that, under reasonable hypotheses, it tracks the asymptotic behaviour of the differential equation with probability one. The differential equation, which can usually be obtained by inspection, is easier to analyze. Novel topics include finite-time behaviour, multiple timescales and asynchronous implementation. There is a useful taxonomy of applications, with concrete examples from engineering and economics. Notably it covers variants of stochastic gradient-based optimization schemes, fixed-point solvers, which are commonplace in learning algorithms for approximate dynamic programming, and some models of collective behaviour. Three appendices give background on differential equations and probability. Simple, compact toolkit for designing and analyzing algorithms, with concrete examples from control and communications engineering, artificial intelligence, economic modelling. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Nº de ref. del artículo: 9780521515924
Cantidad disponible: 1 disponibles