January 1, 1994Open Access

On the learnability of discrete distributions

Puntos clave

Los puntos clave no están disponibles para este artículo en este momento.

Resumen

We introduce and investigate a new model of learning probability distributions from independent draws. Our model is inspired by the popular Probably Approximately Correct (PAC) model for learning boolean functions from labeled

Preguntar a la IA

Me gusta

Guardar

Ver artículo completo

Cite This Study

Kearns et al. (Sat,) studied this question.

synapsesocial.com/papers/6a0f99a48090e499da5ff4e4 https://doi.org/https://doi.org/10.1145/195058.195155

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1On the theory of average case complexity1992 · 159 citations
2Estimation of Dependences Based on Empirical Data2006 · 2,249 citations
3Estimation of Dependences Based on Empirical Data: Springer Series in Statistics (Springer Series in Statistics)1982 · 303 citations
4A Greedy Heuristic for the Set-Covering Problem1979 · 2,581 citations
5Learning Integer Lattices1992 · 84 citations

Preguntar a la IA

Me gusta

Guardar

Ver artículo completo