An urn model from learning theory

DOI10.1002/(SICI)1098-2418(199701/03)10:1/2%3C43::AID-RSA3%3E3.0.CO;2-XMaRDI QIDQ3122906zbMATH OpenOpenAlexWikidataFDO

Authors Stéphane Boucheron, Danièle Gardy

Publication date 1 October 1997

Full work available at URL https://doi.org/10.1002/(sici)1098-2418(199701/03)10:1/2%3C43::aid-rsa3%3E3.0.co;2-x

zbMATH Keywords

Gaussian processgenerating functionBessel functionsurn modelsexchangeable variables

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Gaussian processes (60G15) Combinatorial probability (60C05) Exchangeability for stochastic processes (60G09)

Recommendations

• scientific article; zbMATH DE number 96737
• Learning from ambiguous urns
• A unified presentation of some urn models
• A new urn model
• Urn models: A classical exposition
• A theory of the learnable
• A new two-urn model

Cited in

(13)

• Occupancy urn models in the analysis of algorithms
• General urn models with several types of balls and Gaussian limiting fields
• On comparison of clustering properties of point processes
• A phase transition for the heights of a fragmentation tree
• A unified presentation of some urn models
• Generalized urn schemes and technological dynamics
• Bins and balls: Large deviations of the empirical occupancy process
• The number of collisions for the occupancy problem with unequal probabilities
• On the dynamics of systems of urns
• An urn approach to generalized extreme shock models
• Asymptotic regimes for the occupancy scheme of multiplicative cascades
• Statistical distributions connected to motion of substance in a channel of a network
• On the Mabinogion urn model

This page was built for publication: An urn model from learning theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3122906)