Pages that link to "Item:Q5056446"
From MaRDI portal
The following pages link to Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes (Q5056446):
Displaying 6 items.
- Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression) (Q544714) (← links)
- Reliable clustering of Bernoulli mixture models (Q2295043) (← links)
- Statistical learning guarantees for compressive clustering and compressive mixture modeling (Q2664825) (← links)
- (Q3174125) (← links)
- Task-Driven Adaptive Statistical Compressive Sensing of Gaussian Mixture Models (Q4578376) (← links)
- PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification (Q5921685) (← links)
