{"year":"2017","citation":{"ieee":"M. Skórski, “On the complexity of estimating Rènyi divergences,” in <i>2017 IEEE International Symposium on Information Theory (ISIT)</i>, Aachen, Germany, 2017.","ista":"Skórski M. 2017. On the complexity of estimating Rènyi divergences. 2017 IEEE International Symposium on Information Theory (ISIT). ISIT: International Symposium on Information Theory, 8006529.","chicago":"Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.” In <i>2017 IEEE International Symposium on Information Theory (ISIT)</i>. IEEE, 2017. <a href=\"https://doi.org/10.1109/isit.2017.8006529\">https://doi.org/10.1109/isit.2017.8006529</a>.","apa":"Skórski, M. (2017). On the complexity of estimating Rènyi divergences. In <i>2017 IEEE International Symposium on Information Theory (ISIT)</i>. Aachen, Germany: IEEE. <a href=\"https://doi.org/10.1109/isit.2017.8006529\">https://doi.org/10.1109/isit.2017.8006529</a>","ama":"Skórski M. On the complexity of estimating Rènyi divergences. In: <i>2017 IEEE International Symposium on Information Theory (ISIT)</i>. IEEE; 2017. doi:<a href=\"https://doi.org/10.1109/isit.2017.8006529\">10.1109/isit.2017.8006529</a>","short":"M. Skórski, in:, 2017 IEEE International Symposium on Information Theory (ISIT), IEEE, 2017.","mla":"Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.” <i>2017 IEEE International Symposium on Information Theory (ISIT)</i>, 8006529, IEEE, 2017, doi:<a href=\"https://doi.org/10.1109/isit.2017.8006529\">10.1109/isit.2017.8006529</a>."},"ec_funded":1,"project":[{"call_identifier":"H2020","grant_number":"682815","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"publisher":"IEEE","main_file_link":[{"url":"https://arxiv.org/abs/1702.01666","open_access":"1"}],"month":"08","publication_status":"published","language":[{"iso":"eng"}],"quality_controlled":"1","article_number":"8006529","title":"On the complexity of estimating Rènyi divergences","conference":{"location":"Aachen, Germany","end_date":"2017-06-30","name":"ISIT: International Symposium on Information Theory","start_date":"2017-06-25"},"date_created":"2019-06-06T12:53:09Z","_id":"6526","external_id":{"arxiv":["1702.01666"]},"publication":"2017 IEEE International Symposium on Information Theory (ISIT)","status":"public","day":"09","scopus_import":1,"type":"conference","oa":1,"author":[{"id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","last_name":"Skórski","first_name":"Maciej","full_name":"Skórski, Maciej"}],"oa_version":"Preprint","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrPi"}],"doi":"10.1109/isit.2017.8006529","date_updated":"2021-01-12T08:07:53Z","publication_identifier":{"isbn":["9781509040964"]},"date_published":"2017-08-09T00:00:00Z","abstract":[{"text":"This paper studies the complexity of estimating Rényi divergences of discrete distributions: p observed from samples and the baseline distribution q known a priori. Extending the results of Acharya et al. (SODA'15) on estimating Rényi entropy, we present improved estimation techniques together with upper and lower bounds on the sample complexity. We show that, contrarily to estimating Rényi entropy where a sublinear (in the alphabet size) number of samples suffices, the sample complexity is heavily dependent on events occurring unlikely in q, and is unbounded in general (no matter what an estimation technique is used). For any divergence of integer order bigger than 1, we provide upper and lower bounds on the number of samples dependent on probabilities of p and q (the lower bounds hold for non-integer orders as well). We conclude that the worst-case sample complexity is polynomial in the alphabet size if and only if the probabilities of q are non-negligible. This gives theoretical insights into heuristics used in the applied literature to handle numerical instability, which occurs for small probabilities of q. Our result shows that they should be handled with care not only because of numerical issues, but also because of a blow up in the sample complexity.","lang":"eng"}]}