A simple polynomial-time approximation algorithm for the total variation distance between two product distributions.
Weiming FengHeng GuoMark JerrumJiaheng WangPublished in: SOSA (2023)
Keyphrases
- total variation
- polynomial time approximation
- total variation minimization
- dynamic programming
- np hard
- blind deconvolution
- computational complexity
- worst case
- minimization problems
- optimal solution
- multiplicative noise removal
- dual formulation
- error bounds
- theoretical analysis
- image restoration
- convex optimization
- kullback leibler divergence
- cost function
- search space
- linear program
- image denoising
- knapsack problem
- expectation maximization
- special case
- high quality