Adaptive Lasso and group-Lasso for functional Poisson regression

Abstract

High dimensional Poisson regression has become a standard framework for the analysis of massive counts datasets. In this work we estimate the intensity function of the Poisson regression model by using a dictionary approach, which generalizes the classical basis approach, combined with a Lasso or a group-Lasso procedure. Selection depends on penalty weights that need to be calibrated. Standard methodologies developed in the Gaussian framework can not be directly applied to Poisson models due to heteroscedasticity. Here we provide data-driven weights for the Lasso and the group-Lasso derived from concentration inequalities adapted to the Poisson case. We show that the associated Lasso and group-Lasso procedures are theoretically optimal in the oracle approach. Simulations are used to assess the empirical performance of our procedure, and an original application to the analysis of Next Generation Sequencing data is provided.

References in corpus (6)

• Simultaneous analysis of Lasso and Dantzig selector
• On the conditions used to prove oracle results for the Lasso
• Consistency of the group Lasso and multiple kernel learning
• Support union recovery in high-dimensional multivariate regression
• Regularization for Cox's proportional hazards model with NP-dimensionality
• Learning Heteroscedastic Models by Convex Programming under Group Sparsity

Cited by in corpus (3)

• A data-dependent weighted LASSO under Poisson noise
• Simultaneous Reduction of Number of Spots and Energy Layers in Intensity Modulated Proton Therapy for Rapid Spot Scanning Delivery
• Assessment of Case Influence in the Lasso with a Case-weight Adjusted Solution Path