
Optimization and Learning via Stochastic Gradient Search
Description
Alles über E-Books | Antworten auf Fragen rund um E-Books, Kopierschutz und Dateiformate finden Sie in unserem Info- & Hilfebereich.
This book explains gradient-based stochastic optimization, exploiting the methodologies of stochastic approximation and gradient estimation. Although the approach is theoretical, the book emphasizes developing algorithms that implement the methods. The underlying philosophy of this book is that when solving real problems, mathematical theory, the art of modeling, and numerical algorithms complement each other, with no one outlook dominating the others.
The book first covers the theory of stochastic approximation including advanced models and state-of-the-art analysis methodology, treating applications that do not require the use of gradient estimation. It then presents gradient estimation, developing a modern approach that incorporates cutting-edge numerical algorithms. Finally, the book culminates in a rich set of case studies that integrate the concepts previously discussed into fully worked models. The use of stochastic approximation in statistics and machine learning is discussed, and in-depth theoretical treatments for selected gradient estimation approaches are included.
Numerous examples show how the methods are applied concretely, and end-of-chapter exercises enable readers to consolidate their knowledge. Many chapters end with a section on "Practical Considerations" that addresses typical tradeoffs encountered in implementation. The book provides the first unified treatment of the topic, written for a wide audience that includes researchers and graduate students in applied mathematics, engineering, computer science, physics, and economics.
More details
Other editions
Additional editions

Persons
Content
- Cover
- Contents
- Preface
- I: Theory of Stochastic Optimization and Learning
- 1. Gradient-Based Methods for Deterministic Continuous Optimization
- 1.1. Unconstrained Optimization
- 1.2. Numerical Methods for Unconstrained Optimization
- 1.3. Constrained Optimization
- 1.4. Numerical Methods for Constrained Optimization
- 1.5. Practical Considerations
- 1.6. Exercises
- 2. The Iterative Method Seen as an Ordinary Differential Equation
- 2.1. Motivation
- 2.2. Stability of ODEs
- 2.3. Projected ODEs
- 2.4. On Boundedness of the Trajectories of an ODE
- 2.5. ODE Limit of Recursive Algorithms
- 2.6. The ODE Method for Optimization and Learning
- 2.7. Specific Algorithms for Constrained Optimization
- 2.8. Practical Considerations
- 2.9. Exercises
- 3. Stochastic Approximation: An Introduction
- 3.1. Motivation
- 3.2. Root Finding, Statistical Fitting, and Target Tracking
- 3.3. A Taxonomy for Stochastic Approximation
- 3.4. Overview on Stochastic Approximation
- 3.5. The Sample Average Approach
- 3.6. Practical Considerations
- 3.7. Exercises
- 4. Stochastic Approximation: The Static Model
- 4.1. Martingale Difference Noise Model
- 4.2. Analysis of Decreasing Stepsize SA
- 4.3. Analysis of Constant Stepsize SA
- 4.4. Practical Considerations
- 4.5. Exercises
- 5. Stochastic Approximation: Markovian Dynamics
- 5.1. Long-Term Stationary Dynamics: Markovian Model
- 5.2. Analysis of the Decreasing Stepsize SA
- 5.3. Analysis of the Constant Stepsize SA
- 5.4. Practical Considerations
- 5.5. Exercises
- 6. Asymptotic Efficiency
- 6.1. Motivation
- 6.2. Functional CLT
- 6.3. Asymptotic Efficiency
- 6.4. Practical Considerations
- 6.5. Exercises
- II: Gradient Estimation
- 7. A Primer for Gradient Estimation
- 7.1. Motivation
- 7.2. One-Dimensional Distributions
- 7.3. A Taxonomy of Gradient Estimation
- 7.4. Practical Considerations
- 7.5 Exercises
- 8. Gradient Estimation, Finite Horizon
- 8.1. Perturbation Analysis: IPA and SPA
- 8.2. Distributional Approach: Basic Results and Techniques
- 8.3. The Score Function Method
- 8.4. Measure-Valued Differentiation
- 8.5. Practical Considerations
- 8.6 Exercises
- 9. Gradient Estimation, Markovian Dynamics
- 9.1. The Infinite Horizon Problem
- 9.2. The Random Horizon Problem
- 9.3. The Stationary Problem
- 9.4. Practical Considerations
- 9.5 Exercises
- III: Selected Topics in Stochastic Approximation
- 10. Applications of Stochastic Approximation to Inventory Problems
- 10.1. Optimization Using MVD Gradient Estimation
- 10.2. Model Fitting (An IPA Application)
- 10.3. Variations of the Model
- 11. Pseudo-Gradient Methods
- 11.1. Simultaneous Perturbation Stochastic Approximation
- 11.2. Gaussian Smoothed Functional Approximation
- 11.3. Feasible Perturbed Parameter Values for SPSA and GSFA
- 12. IPA for Discrete Event Systems
- 12.1. Discrete Event Systems
- 12.2. The Commuting Condition
- 12.3. Unbiasedness of IPA
- 12.4. Sufficient Conditions for the Event Condition
- 12.5. Concluding Remarks
- 13. A Markov Operator Approach
- 13.1. The Finite Horizon Problem
- 13.2. The Random Horizon Problem
- 13.3. The Stationary Problem
- 13.4. The Infinite Horizon Problem
- 14. Stochastic Approximation in Statistics
- 14.1. The Score Function in Statistics
- 14.2. Generalized Method of Moments
- 15. Stochastic Gradient Techniques in AI and Machine Learning
- 15.1. Gradient-Based Approaches
- 15.2. Q-Learning and Reinforcement Learning
- IV: Appendixes
- A. Analysis and Linear Algebra
- A.1. Convexity
- A.2. Multidimensional Derivatives
- A.3. Geometric Interpretation of the Gradient
- A.4. Weierstrass Theorem
- A.5. Positive and Negative Definite Matrices
- A.6. Normed Spaces and Equicontinuity
- A.7. Lipschitz and Uniform Continuity
- A.8. Taylor Series Expansions
- A.9. L'Hôpital's Rule
- A.10. Cesàro Limits
- B. Probability Theory
- B.1. Information Structure
- B.2. (Probability) Measures
- B.3. Expectations and Conditioning
- B.4. Convergence of Random Sequences
- B.5. ?-Norm Convergence of Measures
- B.6. Martingale Processes
- B.7. Regenerative Processes
- C. Markov Chains
- C.1. Harris Recurrence
- C.2. Normed Ergodicity and Central Limit Theorem
- C.3. The Poisson Equation for Markov Chains in Discrete Time
- D. Confidence Intervals
- D.1. Independent and Identically Distributed Random Variables
- D.2. Stationary Processes
- D.3. Markov Chains: Long-Term and Stationary Estimation
- Bibliography
- Index
System requirements
File format: PDF
Copy protection: Watermark-DRM (Digital Rights Management)
System requirements:
- Computer (Windows; MacOS X; Linux): Use the free software Adobe Reader, Adobe Digital Editions, or any other PDF viewer of your choice (see eBook Help).
- Tablet/Smartphone (Android; iOS): Install the free app Adobe Digital Editions or another reading app for eBooks, e.g., PocketBook (see eBook Help).
- E-reader: Bookeen, Kobo, Pocketbook, Sony, Tolino and many more (only limited: Kindle).
The file format PDF always displays a book page identically on any hardware. This makes PDF suitable for complex layouts such as those used in textbooks and reference books (images, tables, columns, footnotes). Unfortunately, on the small screens of e-readers or smartphones, PDFs are rather annoying, requiring too much scrolling.
This eBook uses Watermark-DRM, a „soft” copy protection. This means that there are no technical restrictions to prevent illegal distribution. However, there is a personalised watermark embedded in the eBook that can be used to identify the purchaser of the eBook in the event of misuse and to provide evidence for legal purposes.
For more information, see our eBook Help page.