REGO: Rank-based Estimation of Renyi Information using Euclidean Graph Optimization

22 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Nonparametric Divergence Estimation with Applications to Machine Learning on Distributions (2011, methodology): “Recently, Póczos et al. (2010), Pál et al. (2010) proposed a method for consistent Rényi information estimation, but this estimator also uses one sample only and cannot be used for estimating divergences.”
On the Estimation of alpha-Divergences (2011, methodology): “Recently, Póczos et al. (2010); Pál et al. (2010) proposed a method for consistent Rényi information estimation, but this estimator also uses one sample only and cannot be used for estimating divergences.”
On the Estimation of α-Divergences (2011, methodology): “Recently, Póczos et al. (2010); Pál et al. (2010) proposed a method for consistent Rényi information estimation, but this estimator also uses one sample only and cannot be used for estimating divergences.”
Estimation of Renyi Entropy and Mutual Information Based on Generalized Nearest-Neighbor Graphs (2010, result): “This builds upon and extends the previous work of P ´ oczos et al. (2010) where instead of NN graphs, the minimum spanning tree (MST) and the shortest tour through the sample ( i.e. the traveling salesman problem, TSP) were used, but it was only conjectured that NN graphs can be applied as well.”