Genetic Column Generation for Computing Lower Bounds for Adversarial Classification
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917691781021696 |
|---|---|
| author | Penka, Maximilian |
| author_facet | Penka, Maximilian |
| contents | Recent theoretical results on adversarial multi-class classification showed a similarity to the multi-marginal formulation of Wasserstein-barycenter in optimal transport. Unfortunately, both problems suffer from the curse of dimension, making it hard to exploit the nice linear program structure of the problems for numerical calculations. We investigate how ideas from Genetic Column Generation for multi-marginal optimal transport can be used to overcome the curse of dimension in computing the minimal adversarial risk in multi-class classification. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_08331 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Genetic Column Generation for Computing Lower Bounds for Adversarial Classification Penka, Maximilian Numerical Analysis Machine Learning Recent theoretical results on adversarial multi-class classification showed a similarity to the multi-marginal formulation of Wasserstein-barycenter in optimal transport. Unfortunately, both problems suffer from the curse of dimension, making it hard to exploit the nice linear program structure of the problems for numerical calculations. We investigate how ideas from Genetic Column Generation for multi-marginal optimal transport can be used to overcome the curse of dimension in computing the minimal adversarial risk in multi-class classification. |
| title | Genetic Column Generation for Computing Lower Bounds for Adversarial Classification |
| topic | Numerical Analysis Machine Learning |
| url | https://arxiv.org/abs/2406.08331 |