On the public citation graph

Learning Mixtures of Product Distributions over Discrete Domains

0 signed · 57 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0020-0190(92)90237-popenalex-snapshot
Rank-r decision trees are a subclass of r-decision lists
inferredcites →https://doi.org/10.1016/0890-5401(89)90001-1openalex-snapshot
Learning decision trees from random examples
inferredcites →https://doi.org/10.1016/s0024-3795(96)00301-1openalex-snapshot
A theory of pseudoskeleton approximations
inferredcites →https://doi.org/10.1137/1026034openalex-snapshot
Mixture Densities, Maximum Likelihood and the EM Algorithm
inferredcites →https://doi.org/10.1137/s0097539798342496openalex-snapshot
Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model
inferredcites →https://doi.org/10.1145/293347.293351openalex-snapshot
Efficient noise-tolerant learning from statistical queries
inferredcites →https://doi.org/10.2307/2282952openalex-snapshot
Probability Inequalities for Sums of Bounded Random Variables

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-319-49487-6_3openalex-snapshot
Theoretical Analysis of the k-Means Algorithm – A Survey
inferred← citeshttps://doi.org/10.1007/s10107-022-01868-7openalex-snapshot
Polynomial-time algorithms for multimarginal optimal transport problems with structure
inferred← citeshttps://doi.org/10.1007/s10994-010-5179-6openalex-snapshot
Polynomial regression under arbitrary product distributions
inferred← citeshttps://doi.org/10.1007/s10994-015-5489-9openalex-snapshot
Population recovery and partial identification
inferred← citeshttps://doi.org/10.1109/ccsb71176.2026.11716452openalex-snapshot
Ultra-Low-Bitrate Finite Scalar Quantization-Based Speech Entropy Coding for Emergency Communications
inferred← citeshttps://doi.org/10.1109/cdc56724.2024.10886691openalex-snapshot
Multi-Agent Fact-Checker: Adaptive Estimators
inferred← citeshttps://doi.org/10.1109/focs.2010.16openalex-snapshot
Polynomial Learning of Distribution Families
inferred← citeshttps://doi.org/10.1109/focs.2012.14openalex-snapshot
Population Recovery and Partial Identification
inferred← citeshttps://doi.org/10.1109/focs.2013.20openalex-snapshot
A Polynomial Time Algorithm for Lossy Population Recovery
inferred← citeshttps://doi.org/10.1109/focs.2016.85openalex-snapshot
Robust Estimators in High Dimensions without the Computational Intractability
inferred← citeshttps://doi.org/10.1109/focs.2017.16openalex-snapshot
Statistical Query Lower Bounds for Robust Estimation of High-Dimensional Gaussians and Gaussian Mixtures
inferred← citeshttps://doi.org/10.1109/iccv51701.2025.01064openalex-snapshot
Unraveling the Smoothness Properties of Diffusion Models: A Gaussian Mixture Perspective
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206599openalex-snapshot
Distributed Fact Checking
inferred← citeshttps://doi.org/10.1109/ita50056.2020.9244945openalex-snapshot
Differentially Private Algorithms for Learning Mixtures of Separated Gaussians
inferred← citeshttps://doi.org/10.1109/sfcs.2005.46openalex-snapshot
Learning mixtures of product distributions over discrete domains
inferred← citeshttps://doi.org/10.1109/tit.2017.2659660openalex-snapshot
Adversarial Top- $K$ Ranking
inferred← citeshttps://doi.org/10.1109/tit.2021.3049802openalex-snapshot
Private Hypothesis Selection
inferred← citeshttps://doi.org/10.1109/tit.2021.3066010openalex-snapshot
Trace Reconstruction: Generalized and Parameterized
inferred← citeshttps://doi.org/10.1109/tit.2022.3146630openalex-snapshot
Hadamard Extensions and the Identification of Mixtures of Product Distributions
inferred← citeshttps://doi.org/10.1109/tnnls.2018.2884454openalex-snapshot
Identification of the Structure of a Probabilistic Boolean Network From Samples Including Frequencies of Outcomes
inferred← citeshttps://doi.org/10.1137/1.9781611974782.83openalex-snapshot
Sample-Optimal Density Estimation in Nearly-Linear Time
inferred← citeshttps://doi.org/10.1137/13090818xopenalex-snapshot
Polynomial Learning of Distribution Families
inferred← citeshttps://doi.org/10.1137/22m1538788openalex-snapshot
Clustering Mixtures with Almost Optimal Separation in Polynomial Time
inferred← citeshttps://doi.org/10.1145/2554797.2554818openalex-snapshot
Learning mixtures of arbitrary distributions over large discrete domains
inferred← citeshttps://doi.org/10.1145/2688073.2688111openalex-snapshot
On Learning Mixture Models for Permutations
inferred← citeshttps://doi.org/10.1145/2746539.2746584openalex-snapshot
Learning Arbitrary Statistical Mixtures of Discrete Distributions
inferred← citeshttps://doi.org/10.1145/3519935.3520012openalex-snapshot
Clustering mixtures with almost optimal separation in polynomial time
inferred← citeshttps://doi.org/10.1145/3564246.3585209openalex-snapshot
Learning Polynomial Transformations via Generalized Tensor Decompositions
inferred← citeshttps://doi.org/10.1145/3564246.3585212openalex-snapshot
Lifting Uniform Learners via Distributional Decomposition
inferred← citeshttps://doi.org/10.1145/3798129.3800891openalex-snapshot
Testing Distributions against Bounded Distinguishers
inferred← citeshttps://doi.org/10.1184/r1/6476297openalex-snapshot
Robust Hierarchical Clustering
inferred← citeshttps://doi.org/10.1214/08-ejs289openalex-snapshot
Separating populations with wide data: A spectral analysis
inferred← citeshttps://doi.org/10.1214/105051606000000024openalex-snapshot
Learning nonsingular phylogenies and hidden Markov models
inferred← citeshttps://doi.org/10.1287/opre.2020.2013openalex-snapshot
Matching While Learning
inferred← citeshttps://doi.org/10.1609/icwsm.v15i1.18093openalex-snapshot
Network Inference from a Mixture of Diffusion Models for Fake News Mitigation
inferred← citeshttps://doi.org/10.17760/d20413921openalex-snapshot
Differentially private statistical estimation
inferred← citeshttps://doi.org/10.23919/acc60939.2024.10644305openalex-snapshot
Distributed Fact Checking: Learning Unreliability
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2012.1openalex-snapshot
Learning Mixtures of Distributions over Large Discrete Domains
inferred← citeshttps://doi.org/10.48550/arxiv.1103.0598openalex-snapshot
Learning transformed product distributions
inferred← citeshttps://doi.org/10.48550/arxiv.1211.1722openalex-snapshot
Inverse problems in approximate uniform generation
inferred← citeshttps://doi.org/10.48550/arxiv.1212.1527openalex-snapshot
Learning Mixtures of Arbitrary Distributions over Large Discrete Domains
inferred← citeshttps://doi.org/10.48550/arxiv.1302.1515openalex-snapshot
A Polynomial Time Algorithm for Lossy Population Recovery
inferred← citeshttps://doi.org/10.48550/arxiv.1311.2972openalex-snapshot
Learning Mixtures of Discrete Product Distributions using Spectral Decompositions
inferred← citeshttps://doi.org/10.48550/arxiv.1407.7644openalex-snapshot
Estimating the Accuracies of Multiple Classifiers Without Labeled Data
inferred← citeshttps://doi.org/10.48550/arxiv.1502.02158openalex-snapshot
Learning Parametric-Output HMMs with Two Aliased States
inferred← citeshttps://doi.org/10.48550/arxiv.1602.08254openalex-snapshot
Theoretical Analysis of the $k$-Means Algorithm - A Survey
inferred← citeshttps://doi.org/10.48550/arxiv.1603.04549openalex-snapshot
Matching while Learning
inferred← citeshttps://doi.org/10.48550/arxiv.1606.01275openalex-snapshot
Predicting with Distributions
inferred← citeshttps://doi.org/10.48550/arxiv.1702.05574openalex-snapshot
Sample complexity of population recovery
inferred← citeshttps://doi.org/10.5555/1496770.1496887openalex-snapshot
Robust PCA and clustering in noisy mixtures
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.