2000 character limit reached
A Note on New Bernstein-type Inequalities for the Log-likelihood Function of Bernoulli Variables (1909.00250v2)
Published 31 Aug 2019 in math.PR, cs.IT, math.IT, math.ST, and stat.TH
Abstract: We prove a new Bernstein-type inequality for the log-likelihood function of Bernoulli variables. In contrast to classical Bernstein's inequality and Hoeffding's inequality when applied to the log-likelihood, the new bound is independent of the parameters of the Bernoulli variables and therefore does not blow up as the parameters approach 0 or 1. The new inequality strengthens certain theoretical results on likelihood-based methods for community detection in networks and can be applied to other likelihood-based methods for binary data.