Learning mixtures of arbitrary distributions over large discrete domains
From MaRDI portal
Publication:2988881
DOI10.1145/2554797.2554818zbMath1366.68247arXiv1212.1527OpenAlexW2014277097MaRDI QIDQ2988881
Chaitanya Swamy, Leonard J. Schulman, Yuval Rabani
Publication date: 19 May 2017
Published in: Proceedings of the 5th conference on Innovations in theoretical computer science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.1527
linear programmingrandomized algorithmsmoment methodsconvex geometrytopic modelsspectral techniquesmixture learning
Related Items (2)
Cites Work
- A hierarchy of polynomial time lattice basis reduction algorithms
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Trapdoors for hard lattices and new cryptographic constructions
- Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
- Evaluating Branching Programs on Encrypted Data
- Bounds for Width Two Branching Programs
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- New lattice-based cryptographic constructions
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- Unnamed Item
This page was built for publication: Learning mixtures of arbitrary distributions over large discrete domains
