π
π
The Cartographer
A simple polynomial-time approximation algorithm for the total variation distance between two product distributions
August 01, 2022 Β· Declared Dead Β· π SIAM Symposium on Simplicity in Algorithms
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang
arXiv ID
2208.00740
Category
cs.DS: Data Structures & Algorithms
Cross-listed
stat.ME
Citations
13
Venue
SIAM Symposium on Simplicity in Algorithms
Last Checked
3 months ago
Abstract
We give a simple polynomial-time approximation algorithm for the total variation distance between two product distributions.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted