Pith. sign in

REVIEW 1 cited by

Robust Learning of Mixtures of Gaussians

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2007.05912 v1 pith:QHERQS2Z submitted 2020-07-12 cs.DS cs.LGmath.STstat.TH

classification cs.DScs.LGmath.STstat.TH
keywords gaussiansrobustaccessadversariallyalgorithmarbitrarybeencorrupted
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We resolve one of the major outstanding problems in robust statistics. In particular, if $X$ is an evenly weighted mixture of two arbitrary $d$-dimensional Gaussians, we devise a polynomial time algorithm that given access to samples from $X$ an $\eps$-fraction of which have been adversarially corrupted, learns $X$ to error $\poly(\eps)$ in total variation distance.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Implicit High-Order Moment Tensor Estimation and Learning Latent Variable Models

    cs.DS 2024-11 conditional novelty 8.0 of 10

    A unified implicit moment tensor estimation framework yields poly(d,k)-time learners for mixtures of linear regressions, spherical Gaussians, and positive sums of ReLU activations, with one unproven step in the regres...

Pith tools