Enregistré dans:
| Auteurs principaux: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2407.15792 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913440444973056 |
|---|---|
| author | Dmitriev, Daniil Buhai, Rares-Darius Tiegel, Stefan Wolters, Alexander Novikov, Gleb Sanyal, Amartya Steurer, David Yang, Fanny |
| author_facet | Dmitriev, Daniil Buhai, Rares-Darius Tiegel, Stefan Wolters, Alexander Novikov, Gleb Sanyal, Amartya Steurer, David Yang, Fanny |
| contents | We study the problem of estimating the means of well-separated mixtures when an adversary may add arbitrary outliers. While strong guarantees are available when the outlier fraction is significantly smaller than the minimum mixing weight, much less is known when outliers may crowd out low-weight clusters - a setting we refer to as list-decodable mixture learning (LD-ML). In this case, adversarial outliers can simulate additional spurious mixture components. Hence, if all means of the mixture must be recovered up to a small error in the output list, the list size needs to be larger than the number of (true) components. We propose an algorithm that obtains order-optimal error guarantees for each mixture mean with a minimal list-size overhead, significantly improving upon list-decodable mean estimation, the only existing method that is applicable for LD-ML. Although improvements are observed even when the mixture is non-separated, our algorithm achieves particularly strong guarantees when the mixture is separated: it can leverage the mixture structure to partially cluster the samples before carefully iterating a base learner for list-decodable mean estimation at different scales. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_15792 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Robust Mixture Learning when Outliers Overwhelm Small Groups Dmitriev, Daniil Buhai, Rares-Darius Tiegel, Stefan Wolters, Alexander Novikov, Gleb Sanyal, Amartya Steurer, David Yang, Fanny Machine Learning Data Structures and Algorithms We study the problem of estimating the means of well-separated mixtures when an adversary may add arbitrary outliers. While strong guarantees are available when the outlier fraction is significantly smaller than the minimum mixing weight, much less is known when outliers may crowd out low-weight clusters - a setting we refer to as list-decodable mixture learning (LD-ML). In this case, adversarial outliers can simulate additional spurious mixture components. Hence, if all means of the mixture must be recovered up to a small error in the output list, the list size needs to be larger than the number of (true) components. We propose an algorithm that obtains order-optimal error guarantees for each mixture mean with a minimal list-size overhead, significantly improving upon list-decodable mean estimation, the only existing method that is applicable for LD-ML. Although improvements are observed even when the mixture is non-separated, our algorithm achieves particularly strong guarantees when the mixture is separated: it can leverage the mixture structure to partially cluster the samples before carefully iterating a base learner for list-decodable mean estimation at different scales. |
| title | Robust Mixture Learning when Outliers Overwhelm Small Groups |
| topic | Machine Learning Data Structures and Algorithms |
| url | https://arxiv.org/abs/2407.15792 |