Local moment matching: A unified methodology for symmetric functional estimation and distribution estimation under Wasserstein distance

February 23, 2018 Β· Declared Dead Β· πŸ› Annual Conference Computational Learning Theory

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Yanjun Han, Jiantao Jiao, Tsachy Weissman arXiv ID 1802.08405 Category stat.ME Cross-listed cs.IT, cs.LG Citations 41 Venue Annual Conference Computational Learning Theory Last Checked 2 months ago
Abstract
We present \emph{Local Moment Matching (LMM)}, a unified methodology for symmetric functional estimation and distribution estimation under Wasserstein distance. We construct an efficiently computable estimator that achieves the minimax rates in estimating the distribution up to permutation, and show that the plug-in approach of our unlabeled distribution estimator is "universal" in estimating symmetric functionals of discrete distributions. Instead of doing best polynomial approximation explicitly as in existing literature of functional estimation, the plug-in approach conducts polynomial approximation implicitly and attains the optimal sample complexity for the entropy, power sum and support size functionals.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” stat.ME

Died the same way β€” πŸ‘» Ghosted