Genetic Column Generation for Computing Lower Bounds for Adversarial Classification

Maximilian Penka
6/12/2024
math.NAcs.LG

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{penka2024genetic,
  title  = {Genetic Column Generation for Computing Lower Bounds for Adversarial Classification},
  author = {Maximilian Penka},
  year   = {2024},
  eprint = {2406.08331},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2406.08331v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2406.08331.svg)](https://codeofpaper.com/paper/2406.08331)

Discussion