Learning Arbitrary Statistical Mixtures of Discrete Distributions

DOI10.1145/2746539.2746584zbMath1321.68407arXiv1504.02526OpenAlexW2090858014MaRDI QIDQ2941569

Leonard J. Schulman, Chaitanya Swamy, Yuval Rabani, Jian Li

Publication date: 21 August 2015

Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.02526

zbMATH Keywords

approximation theoryrandomized algorithmsspectral methodsconvex geometrytransportation distanceKantorovich-Rubinstein dualitymixture learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Randomized algorithms (68W20)

Related Items (1)

Assigning topics to documents by successive projections

Uses Software

• Graphs

Cites Work

• Unnamed Item
• Ramsey partitions and proximity data structures
• On sparse spanners of weighted graphs
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• On Approximate Distance Labels and Routing Schemes with Affine Stretch
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Approximate distance oracles
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Near-Linear Time Construction of Sparse Neighborhood Covers
• Shortest-path queries in static networks
• Approximate distance oracles with constant query time
• Automata, Languages and Programming

This page was built for publication: Learning Arbitrary Statistical Mixtures of Discrete Distributions