PAC learning of probability distributions over a discrete domain.
From MaRDI portal
Publication:1874385
DOI10.1016/S0304-3975(01)00265-1zbMath1038.68057OpenAlexW1967215060MaRDI QIDQ1874385
Letizia Magnoni, Giulia Simi, Massimo Mirolli, Franco Montagna
Publication date: 25 May 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00265-1
Related Items (1)
Cites Work
- Unnamed Item
- Probability and plurality for aggregations of learning machines
- Investigations on measure-one identification of classes of languages
- Classical recursion theory. Vol. II
- Efficient distribution-free learning of probabilistic concepts
- On the learnability of discrete distributions
- A theory of the learnable
- Probabilistic inductive inference
- Inductive inference of formal languages from positive data
- Probably Approximate Learning over Classes of Distributions
- Language identification in the limit
This page was built for publication: PAC learning of probability distributions over a discrete domain.