Log-concave polynomials, entropy, and a deterministic approximation algorithm for counting bases of matroids.
Nima AnariShayan Oveis GharanCynthia VinzantPublished in: CoRR (2018)
Keyphrases
- learning algorithm
- preprocessing
- computational cost
- objective function
- dynamic programming
- detection algorithm
- improved algorithm
- optimization algorithm
- randomized algorithm
- approximation ratio
- recognition algorithm
- closed form
- matching algorithm
- theoretical analysis
- simulated annealing
- optimal solution
- mutual information
- linear programming
- input data
- high accuracy
- worst case
- experimental evaluation
- cost function
- multi objective
- convergence rate
- significant improvement
- search space
- computational complexity