All listings for this product
Best-selling in Non-Fiction Books
Save on Non-Fiction Books
- AU $50.71Trending at AU $61.55
- AU $32.59Trending at AU $36.88
- AU $32.77Trending at AU $40.84
- AU $30.36Trending at AU $40.12
- AU $30.37Trending at AU $31.39
- AU $15.79Trending at AU $25.15
- AU $14.47Trending at AU $16.66
About this product
- DescriptionThis 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 ecomic modelling. The dynamical systems viewpoint treats an algorithm as a isy 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 asynchrous implementation. There is a useful taxomy of applications, with concrete examples from engineering and ecomics. 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.
- Author BiographyVivek 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.
- Author(s)Vivek S. Borkar
- PublisherCambridge University Press
- Date of Publication01/09/2008
- Place of PublicationCambridge
- Country of PublicationUnited Kingdom
- ImprintCambridge University Press
- Weight380 g
- Width152 mm
- Height228 mm
- Spine17 mm
This item doesn't belong on this page.
Thanks, we'll look into this.