Learning a mixture of two subspaces over finite fields
From MaRDI portal
Cites work
- Algorithmic learning for steganography: proper learning of k-term DNF formulas from positive samples
- Beyond the low-degree algorithm: mixtures of subcubes and their applications
- Cryptography from learning parity with noise
- Efficiently learning mixtures of Mallows models
- Efficiently learning mixtures of two Gaussians
- Learning Arbitrary Statistical Mixtures of Discrete Distributions
- Learning from positive and unlabeled examples
- Learning from satisfying assignments
- Learning from satisfying assignments under continuous distributions
- Learning mixtures of arbitrary distributions over large discrete domains
- Noise-tolerant learning, the parity problem, and the statistical query model
- PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation Assumption
- Polynomial learning of distribution families
- Random low-degree polynomials are hard to approximate
- Robust subspace clustering
- Set Systems with Restricted Cross-Intersections and the Minimum Rank ofInclusion Matrices
- Settling the polynomial learnability of mixtures of Gaussians
- Smoothed analysis in unsupervised learning via decoupling
This page was built for publication: Learning a mixture of two subspaces over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7028635)
