Learning Theory and Kernel Machines
From MaRDI portal
Publication:5305874
DOI10.1007/b12006zbMath1274.68144arXivcs/0306036MaRDI QIDQ5305874
Publication date: 23 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0306036
62M20: Inference from stochastic processes and prediction
68Q32: Computational learning theory
62F15: Bayesian inference
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
Related Items
On generalized computable universal priors and their convergence, Algorithmic complexity bounds on future prediction errors, Open problems in universal induction \& intelligence, On semimeasures predicting Martin-Löf random sequences, Sequential predictions based on algorithmic complexity