Minimum-Entropy Coupling Approximation Guarantees Beyond the Majorization Barrier.
Spencer ComptonDmitriy KatzBenjamin QiKristjan H. GreenewaldMurat KocaogluPublished in: AISTATS (2023)
Keyphrases
- approximation guarantees
- greedy algorithm
- approximation algorithms
- np hard
- objective function
- lower bound
- approximation ratio
- linear programming relaxation
- constant factor
- special case
- greedy algorithms
- search algorithm
- worst case
- dynamic programming
- cross validation
- genetic algorithm
- minimum cost
- mixed integer programming