Two models for analyzing the dynamics of adaptation algorithms
From MaRDI portal
Cited in
(17)- Convergence of stochastic approximation via martingale and converse Lyapunov methods
- Scheduling networks with variable topology in the presence of noise and delays in measurements
- Non-asymptotic error bounds for constant stepsize stochastic approximation for tracking mobile agents
- Adaptive dynamics in games played by heterogeneous populations
- Stabilization of stochastic approximation by step size adaptation
- Event-driven stochastic approximation
- A stochastic Kaczmarz algorithm for network tomography
- Topological orbital equivalence with asymptotic phase for a two time- scales discrete-time system
- Cyclic stochastic approximation with disturbance on input in the parameter tracking problem based on a multiagent algorithm
- Some Examples of Stochastic Approximation in Communications
- Simplified descripton of slow-in-the-average Markov walks
- Convergence of stochastic approximation via martingale and converse Lyapunov methods
- The method of averaged models for discrete-time adaptive systems
- Passification based synchronization of nonlinear systems under communication constraints and bounded disturbances
- Prospect-theoretic Q-learning
- Convergence rates for stochastic approximation: biased noise with unbounded variance, and applications
- scientific article; zbMATH DE number 7627970 (Why is no real title available?)
This page was built for publication: Two models for analyzing the dynamics of adaptation algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1844170)
