Generalization performance of Gaussian kernels SVMC based on Markov sampling

DOI10.1016/j.neunet.2014.01.013zbMath1311.68143DBLPjournals/nn/XuTZXLL14OpenAlexW2066982195WikidataQ50688245 ScholiaQ50688245MaRDI QIDQ2339390

Bin Zou, Yang Lu, Yuan Yan Tang, Jie Xu, Luoqing Li, Zong Ben Xu

Publication date: 1 April 2015

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.neunet.2014.01.013

zbMATH Keywords

generalization performanceMarkov samplingGaussian RBF kernelsuniformly ergodic Markov chain (u.e.M.c.)svmc

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Related Items (4)

Fast Gaussian kernel learning for classification tasks based on specially structured global optimization ⋮ Learning performance of regularized regression with multiscale kernels based on Markov observations ⋮ Convergence and consistency of ERM algorithm with uniformly ergodic Markov chain samples ⋮ Optimal rate for support vector machine regression with Markov chain samples

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Markov chains and stochastic stability
• Model selection for regularized least-squares algorithm in learning theory
• Learning from dependent observations
• Fast rates for support vector machines using Gaussian kernels
• Analysis of support vector machines regression
• Rates of convergence for empirical processes of stationary mixing sequences
• Learning and generalisation. With applications to neural networks.
• Best choices for regularization parameters in learning theory: on the bias-variance problem.
• Statistical behavior and consistency of classification methods based on convex risk minimization.
• Weak convergence and empirical processes. With applications to statistics
• The generalization performance of ERM algorithm with strongly mixing observations
• Learning rates of least-square regularized regression
• Shannon sampling. II: Connections to learning theory
• On the mathematical foundations of learning
• 10.1162/153244302760185252
• Support Vector Machines
• ONLINE LEARNING WITH MARKOV SAMPLING
• Mixing Conditions for Markov Chains
• Minimum complexity regression estimation with weakly dependent observations
• The learning performance of support vector machine classification based on Markov sampling
• Uniform ergodicity and strong mixing
• Theory of Reproducing Kernels

This page was built for publication: Generalization performance of Gaussian kernels SVMC based on Markov sampling