Online learning via congregational gradient descent

DOI10.1007/BF01211551zbMath0891.93091MaRDI QIDQ1377562

Robert C. Williamson, Kim L. Blackmore, William A. Sethares, Mareels, Iven M. Y.

Publication date: 11 February 1998

Published in: MCSS. Mathematics of Control, Signals, and Systems (Search for Journal in Brave)

zbMATH Keywords

optimizationgenetic algorithmsonline learninggradient descentaveraging analysis

Mathematics Subject Classification ID

Stochastic systems and control (93E99) Stochastic learning and adaptive control (93E35)

Related Items

Designing inharmonic strings

Cites Work

• Isomorphisms of genetic algorithms
• Stability theory and the existence of periodic solutions and almost periodic solutions
• Terminal repeller unconstrained subenergy tunneling (TRUST) for fast global optimization
• Blind Equalizers
• Averaging analysis of local stability of a real constant modulus algorithm adaptive filter
• Global optimization of functions by the random optimization method
• Minimization by Random Search Techniques
• Ill-convergence of Godard blind equalizers in data communication systems
• Adaptive Global Search by the Process of Competitive Evolution
• Analysis of recursive stochastic algorithms
• Weak convergence and local stability properties of fixed step size recursive algorithms
• A Globally Convergent Stochastic Approximation
• Asymptotic Global Behavior for Stochastic Approximation and Diffusions with Slowly Decreasing Noise Effects: Global Minimization via Monte Carlo
• Parallel Gradient Distribution in Unconstrained Optimization
• Averaging methods in nonlinear dynamical systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item