A statistical foundation for machine learning, with application to Go- Moku

DOI10.1016/0898-1221(89)90039-4zbMath0688.68080OpenAlexW2013234357MaRDI QIDQ1263996

K. Appert

Publication date: 1989

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(89)90039-4

zbMATH Keywords

noisy measurementsoptimal parameterslearning problemgraph traversing

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Statistical decision theory (62C99)

Related Items

Machine learning for optimal blackjack counting strategies, Sequential design with applications to the trim-loss problem, Nonparametric bandit methods

Cites Work

• Unnamed Item
• On sequential search for the maximum of an unknown function
• Convergence of an annealing algorithm
• Jfon parametric time series analysis and prediction: uniform almost sure convergence of the window and jt-nn autoregression estimates
• Random Search in the Presence of Noise, with Application to Machine Learning
• Asymptotic Global Behavior for Stochastic Approximation and Diffusions with Slowly Decreasing Noise Effects: Global Minimization via Monte Carlo
• A Consistent Estimator for the Identification of Finite Mixtures
• Stochastic Estimation of the Maximum of a Regression Function