On the learnability of discrete distributions
From MaRDI portal
(Redirected from Publication:2817618)
Recommendations
Cited in
(46)- Instance optimal learning of discrete distributions
- Population recovery and partial identification
- Learning fixed-dimension linear thresholds from fragmented data
- Inclusion-exclusion: exact and approximate
- scientific article; zbMATH DE number 1804110 (Why is no real title available?)
- PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
- Equivalences between learning of data and probability distributions, and their applications
- Maximum selection and sorting with adversarial comparators
- scientific article; zbMATH DE number 7307484 (Why is no real title available?)
- Variance-aware estimation of kernel mean embedding
- Separating Populations with Wide Data: A Spectral Analysis
- Robust estimators in high-dimensions without the computational intractability
- Knowing what doesn't matter: exploiting the omission of irrelevant data
- Application of a generalization of Russo's formula to learning from multiple random oracles
- A spectral algorithm for learning hidden Markov models
- Not all learnable distribution classes are privately learnable
- On the learnability and usage of acyclic probabilistic finite automata
- Efficient distribution-free learning of probabilistic concepts
- Learnability with respect to fixed distributions
- Separating populations with wide data: a spectral analysis
- Minimax learning of ergodic Markov chains
- Natural language grammar induction with a generative constituent-context model
- Learning Structure Illuminates Black Boxes – An Introduction to Estimation of Distribution Algorithms
- Efficient parameter estimation of truncated Boolean product distributions
- Probably Approximate Learning over Classes of Distributions
- The minimax learning rates of normal and Ising undirected graphical models
- Private data release via learning thresholds
- Sampling correctors
- Learning distributions by their density levels: A paradigm for learning without a teacher
- The power of amnesia: Learning probabilistic automata with variable memory length
- Cryptography with constant input locality
- \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition
- A comparison of collapsed Bayesian methods for probabilistic finite automata
- Adaptively learning probabilistic deterministic automata from data streams
- Spectral learning of weighted automata. A forward-backward perspective
- Statistical estimation of ergodic Markov chain kernel over discrete state space
- Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
- Relative entropy and envy-free allocation
- On the complexity of estimating the effective support size
- On the complexity of computational problems regarding distributions
- Learning Mixtures of Product Distributions over Discrete Domains
- Approximate minimization of weighted tree automata
- Learning discrete distributions from untrusted batches
- Classical verification of quantum learning
- PAC learning of probability distributions over a discrete domain.
- Efficient learning of typical finite automata from random walks
This page was built for publication: On the learnability of discrete distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817618)
