While reading a blog post about score matching, I came across the term 'regularity condition'. When I searched for it on Google, I found an answer:
The regularity condition refers to a restriction imposed on the likelihood function in order to ensure that the order of expectation operation and differentiation can be interchanged.
However, I don't find this definition to make sense in the context of the blog post and the topic of score matching. So, what does 'regularity condition' actually mean?
Edit : I added direct link to the quote. The author mentioned that term in context of explaining why we can drop two first term in the equation below :
\begin{align*} &\underbrace{-\lim_{b \to \infty} \nabla_x \log p_m(b; \theta) p_d(b)}_{0} + \underbrace{\lim_{a \to -\infty} \nabla_x \log p_m(a; \theta) p_d(a)}_{0} \\ &+ \int_{-\infty}^{\infty} \nabla_x^2 p_m(x; \theta) p_d(x) \, dx. \end{align*}
Hyvärinen et al. make the assumption (this is a regularity condition in their Theorem 1) that for any $\theta$,
\begin{equation} p_d(x) \nabla_x \log p_m(x; \theta) \to 0 \quad \text{when} \quad \|x\|_2 \to \infty, \end{equation}
which allows us to drop the first two terms.