Kernel entropy estimation for linear processes
Hailing Sang, Yongli Sang, Fangjun Xu

TL;DR
This paper develops a kernel-based method for estimating the quadratic functional of the density of linear processes, extending previous i.i.d. results to dependent data with short-range dependence, and demonstrates its effectiveness through simulations and real data applications.
Contribution
It introduces a kernel entropy estimator for linear processes, extending asymptotic properties known for i.i.d. data to dependent processes with short-range dependence.
Findings
Estimator has similar asymptotic properties as in the i.i.d. case.
Simulation confirms theoretical results for Gaussian and alpha-stable innovations.
Application to river flow data demonstrates practical utility.
Abstract
Let be a linear process with bounded probability density function . We study the estimation of the quadratic functional . With a Fourier transform on the kernel function and the projection method, it is shown that, under certain mild conditions, the estimator \[ \frac{2}{n(n-1)h_n} \sum_{1\le i<j\le n}K\left(\frac{X_i-X_j}{h_n}\right) \] has similar asymptotical properties as the i.i.d. case studied in Gin\'{e} and Nickl (2008) if the linear process has the defined short range dependence. We also provide an application to divergence and the extension to multivariate linear processes. The simulation study for linear processes with Gaussian and -stable innovations confirms our theoretical results. As an illustration, we estimate the divergences among the density functions of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Mechanics and Entropy · Control Systems and Identification · Probabilistic and Robust Engineering Design
