Learning and generalisation. With applications to neural networks.
From MaRDI portal
Publication:1856371
zbMath1008.68102MaRDI QIDQ1856371
Publication date: 3 February 2003
Published in: Communications and Control Engineering (Search for Journal in Brave)
identification; empirical means; neural network; NP-hard; mixing property; statistical learning; finite-time estimates; synthesis algorithms
68Q32: Computational learning theory
68T05: Learning and adaptive systems in artificial intelligence
93E12: Identification in stochastic control theory
93B50: Synthesis problems
93E35: Stochastic learning and adaptive control
68-02: Research exposition (monographs, survey articles) pertaining to computer science
Related Items
Optimal rate for support vector machine regression with Markov chain samples, On a clustering criterion for dependent observations, Generalization bounds of ERM algorithm with Markov chain samples, Generalization bounds of ERM algorithm with \(V\)-geometrically ergodic Markov chains, Indexability, concentration, and VC theory, Monte Carlo algorithms for optimal stopping and statistical learning, Simulation-based optimization of Markov decision processes: an empirical process theory approach, Learning performance of Tikhonov regularization algorithm with geometrically beta-mixing observations, Classification with non-i.i.d. sampling, Generalization performance of least-square regularized regression algorithm with Markov chain samples, Probabilistic methods in cancer biology, Regularized least square regression with dependent samples, Unsupervised slow subspace-learning from stationary processes, Computational complexity of randomized algorithms for solving parameter-dependent linear matrix inequalities., Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions, Generalization performance of Gaussian kernels SVMC based on Markov sampling, Learning rates of regularized regression for exponentially strongly mixing sequence, Fast learning from \(\alpha\)-mixing observations, The performance bounds of learning machines based on exponentially strongly mixing sequences, ℓ1-Norm support vector machine for ranking with exponentially strongly mixing sequence
