Learning performance of the perceptron model based on Markov sampling

DOI10.20142/J.CNKI.AMAS.202501042MaRDI QIDQ6914508zbMATH OpenFDO

Authors Shu-Lan Hu, Zhiyong Qian, Renhe Wang, Xinyu Wang

Publication date 16 October 2025

Published in Acta Mathematicae Applicatae Sinica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.20142/J.CNKI.AMAS.202501042

zbMATH Keywords

learning performanceMarkov samplingperceptron modeluniformly ergodic Markov chain

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• Best choices for regularization parameters in learning theory: on the bias-variance problem.
• Complexity of random smooth functions on the high-dimensional sphere
• Hoeffding's inequality for general Markov chains and its applications to statistical learning
• scientific article; zbMATH DE number 4048925 (Why is no real title available?)
• scientific article; zbMATH DE number 3314813 (Why is no real title available?)
• scientific article; zbMATH DE number 3189712 (Why is no real title available?)
• Learning from dependent observations
• Learning with coefficient-based regularization and ^1-penalty
• Markov chains and stochastic stability
• Modified optimization layer by layer algorithm for learning multilayer perceptrons
• Monte Carlo sampling methods using Markov chains and their applications
• Neural Network Learning
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images

This page was built for publication: Learning performance of the perceptron model based on Markov sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6914508)