Convex and non-convex regularization methods for spatial point processes intensity estimation
arXiv:1703.02462 · doi:10.1214/18-EJS1408
Abstract
This paper deals with feature selection procedures for spatial point processes intensity estimation. We consider regularized versions of estimating equations based on Campbell theorem derived from two classical functions: Poisson likelihood and logistic regression likelihood. We provide general conditions on the spatial point processes and on penalty functions which ensure consistency, sparsity and asymptotic normality. We discuss the numerical implementation and assess finite sample properties in a simulation study. Finally, an application to tropical forestry datasets illustrates the use of the proposed methods.
References in corpus (19)
- Discussion of "Least angle regression" by Efron et al
- Rejoinder to "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Least Angle Regression
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Nearly unbiased variable selection under minimax concave penalty
- Pathwise coordinate optimization
- On the adaptive elastic-net with a diverging number of parameters
- One-step sparse estimates in nonconcave penalized likelihood models
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
- High-dimensional variable selection
- Determinantal point process models and statistical inference : Extended version
- Quasi-likelihood for Spatial Point Processes
- Variational approach for spatial point process intensity estimation