Convergence
Convergence is the process or property by which successive states or results approach a stable, limiting, or mutually consistent outcome.
Grokking AI Algorithms, Second Edition
Convergence is the process by which particles increasingly gather around a common region or solution in the search space.
- How it is used
- Uses social influence to move a particle swarm toward promising discoveries during search.
- How deep it goes
- Explains convergence through inertia, cognitive and social urges, velocity updates, position updates, and local-optimum risk.
- Examples
- Illustrates convergence with tourist voices, particle-position tables, velocity calculations, and search-space visualizations.
- What you can do after
- Apply it via particle-update code that balances personal discoveries against the swarm’s best position.
Read how Grokking AI Algorithms, Second Edition explains convergence →
Advanced Algorithms and Data Structures
Convergence is the condition in an iterative computation where successive updates no longer change the solution or assignment.
- How it is used
- Uses unchanged successive states or bounded iterations to stop iterative optimization and approximation procedures.
- How deep it goes
- Explains assignment-based stopping, iteration limits, initialization effects, and shrinking update steps, but defers the sphere algorithm’s details.
- Examples
- Uses changing k-means cluster assignments, genetic optimization of a ten-city tour, and iterative smallest-enclosing-sphere approximation.
- What you can do after
- Diagnose/debug iterative algorithms by selecting state-change checks, iteration bounds, initialization strategies, and controlled update sizes.
Read how Advanced Algorithms and Data Structures explains convergence →
Ensemble Methods for Machine Learning
Convergence is the approach of an iterative procedure toward a stable solution or stopping condition.
- How it is used
- Uses convergence to decide when an iterative optimization procedure has reached a sufficiently stable solution.
- How deep it goes
- Defines convergence procedurally with a tolerance check, but does not develop formal convergence proofs.
- Examples
- Uses Branin optimization, descent paths, shrinking steps, zigzagging, and alternative initializations to illustrate convergence behavior.
- What you can do after
- Apply it via a tolerance-based stopping test in gradient descent and interpret the resulting optimization path.
Read how Ensemble Methods for Machine Learning explains convergence →
Geometry for Programmers
Convergence is the property of an iterative algorithm progressively approaching a solution, often characterized by the rate of that approach.
- How it is used
- Guides the selection and evaluation of iterative solvers for systems of linear equations.
- How deep it goes
- Explains progress rate, divergence, stability, accumulated error, and matrix conditions, but stops short of formal convergence analysis.
- Examples
- Uses accumulated-error percentages, projection steps, Jacobi and Gauss-Seidel methods, diagonally dominant matrices, and preconditioning.
- What you can do after
- Evaluate/understand whether an iterative solver is likely to approach a solution reliably and when preprocessing may be needed.
Related concepts
- split brain resolveraddressed by · The Akka Split Brain Resolver is a cluster-partition handling mechanism that automatically decides which nodes remain active and which are downed.
- rerunnable processequivalent to · A rerunnable process is a process that can be executed again after partial failure without code changes or unintended duplicate results.
- gradient descentmeasures · Gradient descent is an iterative optimization method that updates parameters opposite the gradient of an objective function to reduce its value.
- early stoppingcontrasts with · Early stopping is a technique that terminates an iterative process before its planned completion when a specified condition indicates that further work is unnecessary or unlikely to improve the objective.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.