Pages that link to "Item:Q2817618"

The following pages link to On the learnability of discrete distributions (Q2817618):

Displaying 25 items.

• Population recovery and partial identification (Q255358) (← links)
• A spectral algorithm for learning hidden Markov models (Q439990) (← links)
• Spectral learning of weighted automata. A forward-backward perspective (Q479459) (← links)
• Adaptively learning probabilistic deterministic automata from data streams (Q479463) (← links)
• \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition (Q479466) (← links)
• A comparison of collapsed Bayesian methods for probabilistic finite automata (Q479467) (← links)
• The power of amnesia: Learning probabilistic automata with variable memory length (Q676238) (← links)
• Cryptography with constant input locality (Q1037233) (← links)
• Knowing what doesn't matter: exploiting the omission of irrelevant data (Q1127363) (← links)
• On the learnability and usage of acyclic probabilistic finite automata (Q1271548) (← links)
• Learning distributions by their density levels: A paradigm for learning without a teacher (Q1370866) (← links)
• Efficient learning of typical finite automata from random walks (Q1373138) (← links)
• Inclusion-exclusion: exact and approximate (Q1375692) (← links)
• Equivalences between learning of data and probability distributions, and their applications (Q1784951) (← links)
• Learning fixed-dimension linear thresholds from fragmented data (Q1854473) (← links)
• PAC learning of probability distributions over a discrete domain. (Q1874385) (← links)
• Separating populations with wide data: a spectral analysis (Q1951968) (← links)
• Approximate minimization of weighted tree automata (Q2064525) (← links)
• Relative entropy and envy-free allocation (Q2171250) (← links)
• The minimax learning rates of normal and Ising undirected graphical models (Q2192304) (← links)
• Statistical estimation of ergodic Markov chain kernel over discrete state space (Q2214258) (← links)
• Learning Poisson binomial distributions (Q2345953) (← links)
• PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance (Q2465033) (← links)
• Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms (Q2485074) (← links)
• Natural language grammar induction with a generative constituent-context model (Q2485082) (← links)