The following pages link to (Q3997575):
Displaying 50 items.
- Almost sure convergence of Titterington's recursive estimator for mixture models (Q866603) (← links)
- A learning algorithm for adaptive canonical correlation analysis of several data sets (Q866746) (← links)
- Strong consistency of the regularized least-squares estimates of infinite autoregressive models (Q872084) (← links)
- A simulation optimization method that considers uncertainty and multiple performance measures (Q872272) (← links)
- An online sequential algorithm for the estimation of transition probabilities for jump Markov linear systems (Q880350) (← links)
- Importance sampling and statistical Romberg method (Q888470) (← links)
- Adaptive sequential Monte Carlo by means of mixture of experts (Q892475) (← links)
- A stopping rule for stochastic approximation (Q900181) (← links)
- Coordinated motion of autonomous vehicles with the use of a distributed gradient algorithm (Q928068) (← links)
- Escapist policy rules (Q956474) (← links)
- High-dimensional exploratory item factor analysis by a Metropolis-Hastings Robbins-Monro algorithm (Q971529) (← links)
- Unconstrained recursive importance sampling (Q988764) (← links)
- Period analysis of variable stars: temporal dependence and local optima (Q1020710) (← links)
- Tracking and identification of regime-switching systems using binary sensors (Q1023359) (← links)
- Monetary policy, learning and the speed of convergence (Q1027407) (← links)
- On deregulating food prices (Q1037434) (← links)
- Natural actor-critic algorithms (Q1049136) (← links)
- Rates of convergence in a central limit theorem for stochastic processes defined by differential equations with a small parameter (Q1201123) (← links)
- Grouping for optimal growth (Q1274851) (← links)
- Convergence analysis of dynamic stochastic approximation (Q1275559) (← links)
- Stochastic gradient algorithm with random truncations (Q1278958) (← links)
- Stochastic approximation algorithms with constant step size whose average is cooperative (Q1296595) (← links)
- Weak convergence rates for stochastic approximation with application to multiple targets and simulated annealing (Q1296615) (← links)
- Asymptotic behavior of self-organizing maps with nonuniform stimuli distribution (Q1296630) (← links)
- Convergence of learning algorithms without a projection facility (Q1300379) (← links)
- Early warning of slight changes in systems (Q1314747) (← links)
- Fast adaptive algorithms and networks for class-separability features. (Q1403759) (← links)
- Limit theorems for random normalized distortion (Q1431553) (← links)
- Adaptive dynamics in games played by heterogeneous populations (Q1566893) (← links)
- On the existence of fixed points for approximate value iteration and temporal-difference learning (Q1586803) (← links)
- Stability of annealing schemes and related processes (Q1589565) (← links)
- Blind channel identification via stochastic approximation: constant step-size algorithms (Q1605401) (← links)
- An online prediction algorithm for reinforcement learning with linear function approximation using cross entropy method (Q1631797) (← links)
- Outlier robust stochastic approximation algorithm for identification of MIMO Hammerstein models (Q1637273) (← links)
- A convergence analysis of the perturbed compositional gradient flow: averaging principle and normal deviations (Q1659690) (← links)
- Asymptotic behavior of truncated stochastic approximation procedures (Q1678527) (← links)
- Asymptotic bias of stochastic gradient search (Q1704136) (← links)
- Generalization of a result of Fabian on the asymptotic normality of stochastic approximation (Q1716693) (← links)
- A novel approach for nonstationary time series analysis with time-invariant correlation coefficient (Q1717758) (← links)
- Blocks of coordinates, stochastic programming, and markets (Q1722745) (← links)
- General multilevel adaptations for stochastic approximation algorithms of Robbins-Monro and Polyak-Ruppert type (Q1740634) (← links)
- On the convergence of reinforcement learning (Q1779805) (← links)
- On the almost sure asymptotic behaviour of stochastic algorithm (Q1807280) (← links)
- An almost sure central limit theorem for stochastic approximation algorithms (Q1808838) (← links)
- Optimal properties of stimulus-response learning models. (Q1818296) (← links)
- Adaptive soft \(k\)-nearest-neighbour classifiers (Q1860089) (← links)
- Convergence rate of linear two-time-scale stochastic approximation. (Q1879892) (← links)
- An adaptive simulated annealing algorithm. (Q1888770) (← links)
- Learning in extensive-form games: Experimental data and simple dynamic models in the intermediate term (Q1890914) (← links)
- Learning competitive market balance (Q1904634) (← links)
