Sciweavers

181 search results - page 3 / 37
» Polynomial Learning of Distribution Families
Sort
View
ICPR
2000
IEEE
14 years 6 months ago
General Bias/Variance Decomposition with Target Independent Variance of Error Functions Derived from the Exponential Family of D
An important theoretical tool in machine learning is the bias/variance decomposition of the generalization error. It was introduced for the mean square error in [3]. The bias/vari...
Jakob Vogdrup Hansen, Tom Heskes
ICCV
2007
IEEE
14 years 7 months ago
Learning priors for calibrating families of stereo cameras
Online camera recalibration is necessary for long-term deployment of computer vision systems. Existing algorithms assume that the source of recalibration information is a set of f...
Andrew W. Fitzgibbon, Duncan P. Robertson, Antonio...
COLT
2000
Springer
13 years 9 months ago
Average-Case Complexity of Learning Polynomials
The present paper deals with the averagecase complexity of various algorithms for learning univariate polynomials. For this purpose an appropriate framework is introduced. Based o...
Frank Stephan, Thomas Zeugmann
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 5 months ago
Online Learning of Noisy Data with Kernels
We study online learning when individual instances are corrupted by adversarially chosen random noise. We assume the noise distribution is unknown, and may change over time with n...
Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, O...
ICML
1999
IEEE
14 years 6 months ago
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
Rajesh Parekh, Vasant Honavar