Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

COLT
1992
Springer

favoriteEmaildiscussreport

88views Machine Learning» more COLT 1992»

Dominating Distributions and Learnability

13 years 8 months ago

Dominating Distributions and Learnability

Download www.cs.iastate.edu

We consider PAC-learning where the distribution is known to the student. The problem addressed here is characterizing when learnability with respect to distribution D1 implies learnability with respect to distribution Dz. The answer to the above question depends on the learnability model. If the number of examples need not be bounded by a polynomial, it is sufficient to require that all sets which have zero probability with respect to Dz have zero

Gyora M. Benedek, Alon Itai

Real-time Traffic

COLT 1992 | Distribution Dz | Learnability | Learnability Model | Machine Learning |

claim paper

Related Content

» Fractionation rearrangement and subgenome dominance

» Learning DFA from Simple Examples

» Learning Context Free Grammars in the Limit Aided by the Sample Distribution

» UniformDistribution Attribute Noise Learnability

» Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples

» Learning conditional preference networks

» On the Learnability and Usage of Acyclic Probabilistic Finite Automata

» On the Learnability of the Uncomputable

» The LEM3 implementation of learnable evolution model and its testing on complex function o...

Post Info
More Details (n/a)

Added	09 Aug 2010
Updated	09 Aug 2010
Type	Conference
Year	1992
Where	COLT
Authors	Gyora M. Benedek, Alon Itai

Comments (0)