Online learning via congregational gradient descent (Q1377562)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Online learning via congregational gradient descent |
scientific article; zbMATH DE number 1109544
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Online learning via congregational gradient descent |
scientific article; zbMATH DE number 1109544 |
Statements
Online learning via congregational gradient descent (English)
0 references
11 February 1998
0 references
The paper studies a version of the stepwise gradient descent algorithm consisting in the update of a population of solutions. The algorithm allows the determination of the global minimum of the expected cost function and is suitable for a broad class of learning and optimization problems. An averaging analysis of the algorithm allows to study its behaviour in terms of an associated ordinary differential equation. The speed of convergence and the effect of different population sizes are also studied. Simulation examples are finally provided.
0 references
genetic algorithms
0 references
online learning
0 references
gradient descent
0 references
optimization
0 references
averaging analysis
0 references
0 references
0 references
0 references
0.89284027
0 references
0.8832186
0 references
0.8812028
0 references
0 references
0.87501097
0 references
0.8716712
0 references
0.8679108
0 references
